On the maximum scatter TSP

Esther M. Arkin, Yi-Jen Chiang, Joseph S B Mitchell, Steven S. Skiena, Tae Cheon Yang

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    We study the problem of computing a Hamiltonian tour (cycle) or path on a set of points in order to maximize the minimum edge length in the tour or path. This `maximum scatter' TSP is closely related to the bottleneck TSP, and is motivated by applications in manufacturing (e.g., sequencing of rivet operations) and medical imaging. In this paper, we give the first algorithmic study of these problems, including complexity results, approximation algorithms, and exact algorithms for special cases. In an attempt to model more accurately the real problems that arise in practice, we also generalize the basic problem to consider a more general measure of `scatter' in which points on a tour or path should be far not only from their immediate predecessor and successor, but also from other near-neighbors along the tour or path.

    Original languageEnglish (US)
    Title of host publicationProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
    Editors Anon
    PublisherACM
    Pages211-220
    Number of pages10
    StatePublished - 1997
    EventProceedings of the 1996 8th Annual ACM-SIAM Symposium on Discrete Algorithms - New Orleans, LA, USA
    Duration: Jan 5 1997Jan 7 1997

    Other

    OtherProceedings of the 1996 8th Annual ACM-SIAM Symposium on Discrete Algorithms
    CityNew Orleans, LA, USA
    Period1/5/971/7/97

    Fingerprint

    Rivets
    Hamiltonians
    Medical imaging
    Approximation algorithms
    Scatter
    Path
    Hamiltonian path
    Hamiltonian circuit
    Medical Imaging
    Exact Algorithms
    Set of points
    Sequencing
    Approximation Algorithms
    Nearest Neighbor
    Manufacturing
    Maximise
    Generalise
    Computing

    ASJC Scopus subject areas

    • Chemical Health and Safety
    • Software
    • Safety, Risk, Reliability and Quality
    • Discrete Mathematics and Combinatorics

    Cite this

    Arkin, E. M., Chiang, Y-J., Mitchell, J. S. B., Skiena, S. S., & Yang, T. C. (1997). On the maximum scatter TSP. In Anon (Ed.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 211-220). ACM.

    On the maximum scatter TSP. / Arkin, Esther M.; Chiang, Yi-Jen; Mitchell, Joseph S B; Skiena, Steven S.; Yang, Tae Cheon.

    Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. ed. / Anon. ACM, 1997. p. 211-220.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Arkin, EM, Chiang, Y-J, Mitchell, JSB, Skiena, SS & Yang, TC 1997, On the maximum scatter TSP. in Anon (ed.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, pp. 211-220, Proceedings of the 1996 8th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, USA, 1/5/97.
    Arkin EM, Chiang Y-J, Mitchell JSB, Skiena SS, Yang TC. On the maximum scatter TSP. In Anon, editor, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. ACM. 1997. p. 211-220
    Arkin, Esther M. ; Chiang, Yi-Jen ; Mitchell, Joseph S B ; Skiena, Steven S. ; Yang, Tae Cheon. / On the maximum scatter TSP. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. editor / Anon. ACM, 1997. pp. 211-220
    @inproceedings{ac1fb25d1d304da19089d9a61b54fb4e,
    title = "On the maximum scatter TSP",
    abstract = "We study the problem of computing a Hamiltonian tour (cycle) or path on a set of points in order to maximize the minimum edge length in the tour or path. This `maximum scatter' TSP is closely related to the bottleneck TSP, and is motivated by applications in manufacturing (e.g., sequencing of rivet operations) and medical imaging. In this paper, we give the first algorithmic study of these problems, including complexity results, approximation algorithms, and exact algorithms for special cases. In an attempt to model more accurately the real problems that arise in practice, we also generalize the basic problem to consider a more general measure of `scatter' in which points on a tour or path should be far not only from their immediate predecessor and successor, but also from other near-neighbors along the tour or path.",
    author = "Arkin, {Esther M.} and Yi-Jen Chiang and Mitchell, {Joseph S B} and Skiena, {Steven S.} and Yang, {Tae Cheon}",
    year = "1997",
    language = "English (US)",
    pages = "211--220",
    editor = "Anon",
    booktitle = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",
    publisher = "ACM",

    }

    TY - GEN

    T1 - On the maximum scatter TSP

    AU - Arkin, Esther M.

    AU - Chiang, Yi-Jen

    AU - Mitchell, Joseph S B

    AU - Skiena, Steven S.

    AU - Yang, Tae Cheon

    PY - 1997

    Y1 - 1997

    N2 - We study the problem of computing a Hamiltonian tour (cycle) or path on a set of points in order to maximize the minimum edge length in the tour or path. This `maximum scatter' TSP is closely related to the bottleneck TSP, and is motivated by applications in manufacturing (e.g., sequencing of rivet operations) and medical imaging. In this paper, we give the first algorithmic study of these problems, including complexity results, approximation algorithms, and exact algorithms for special cases. In an attempt to model more accurately the real problems that arise in practice, we also generalize the basic problem to consider a more general measure of `scatter' in which points on a tour or path should be far not only from their immediate predecessor and successor, but also from other near-neighbors along the tour or path.

    AB - We study the problem of computing a Hamiltonian tour (cycle) or path on a set of points in order to maximize the minimum edge length in the tour or path. This `maximum scatter' TSP is closely related to the bottleneck TSP, and is motivated by applications in manufacturing (e.g., sequencing of rivet operations) and medical imaging. In this paper, we give the first algorithmic study of these problems, including complexity results, approximation algorithms, and exact algorithms for special cases. In an attempt to model more accurately the real problems that arise in practice, we also generalize the basic problem to consider a more general measure of `scatter' in which points on a tour or path should be far not only from their immediate predecessor and successor, but also from other near-neighbors along the tour or path.

    UR - http://www.scopus.com/inward/record.url?scp=0030823077&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0030823077&partnerID=8YFLogxK

    M3 - Conference contribution

    AN - SCOPUS:0030823077

    SP - 211

    EP - 220

    BT - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

    A2 - Anon, null

    PB - ACM

    ER -