On the maximum scatter traveling salesperson problem

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

    Research output: Contribution to journalArticle

    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' traveling salesperson problem (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)
    Pages (from-to)515-544
    Number of pages30
    JournalSIAM Journal on Computing
    Volume29
    Issue number2
    StatePublished - Oct 1999

    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

    • Computational Theory and Mathematics
    • Applied Mathematics
    • Theoretical Computer Science

    Cite this

    Arkin, E. M., Chiang, Y-J., Mitchell, J. S. B., Skiena, S. S., & Yang, T. C. (1999). On the maximum scatter traveling salesperson problem. SIAM Journal on Computing, 29(2), 515-544.

    On the maximum scatter traveling salesperson problem. / Arkin, Esther M.; Chiang, Yi-Jen; Mitchell, J. S B; Skiena, Steven S.; Yang, Tae Cheon.

    In: SIAM Journal on Computing, Vol. 29, No. 2, 10.1999, p. 515-544.

    Research output: Contribution to journalArticle

    Arkin, EM, Chiang, Y-J, Mitchell, JSB, Skiena, SS & Yang, TC 1999, 'On the maximum scatter traveling salesperson problem', SIAM Journal on Computing, vol. 29, no. 2, pp. 515-544.
    Arkin EM, Chiang Y-J, Mitchell JSB, Skiena SS, Yang TC. On the maximum scatter traveling salesperson problem. SIAM Journal on Computing. 1999 Oct;29(2):515-544.
    Arkin, Esther M. ; Chiang, Yi-Jen ; Mitchell, J. S B ; Skiena, Steven S. ; Yang, Tae Cheon. / On the maximum scatter traveling salesperson problem. In: SIAM Journal on Computing. 1999 ; Vol. 29, No. 2. pp. 515-544.
    @article{06f18e54bf3640c193f6200ebc79fda0,
    title = "On the maximum scatter traveling salesperson problem",
    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' traveling salesperson problem (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, {J. S B} and Skiena, {Steven S.} and Yang, {Tae Cheon}",
    year = "1999",
    month = "10",
    language = "English (US)",
    volume = "29",
    pages = "515--544",
    journal = "SIAM Journal on Computing",
    issn = "0097-5397",
    publisher = "Society for Industrial and Applied Mathematics Publications",
    number = "2",

    }

    TY - JOUR

    T1 - On the maximum scatter traveling salesperson problem

    AU - Arkin, Esther M.

    AU - Chiang, Yi-Jen

    AU - Mitchell, J. S B

    AU - Skiena, Steven S.

    AU - Yang, Tae Cheon

    PY - 1999/10

    Y1 - 1999/10

    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' traveling salesperson problem (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' traveling salesperson problem (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=0033301072&partnerID=8YFLogxK

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

    M3 - Article

    VL - 29

    SP - 515

    EP - 544

    JO - SIAM Journal on Computing

    JF - SIAM Journal on Computing

    SN - 0097-5397

    IS - 2

    ER -