• myGriffith
    • Staff portal
    • Contact Us⌄
      • Future student enquiries 1800 677 728
      • Current student enquiries 1800 154 055
      • International enquiries +61 7 3735 6425
      • General enquiries 07 3735 7111
      • Online enquiries
      • Staff phonebook
    View Item 
    •   Home
    • Griffith Research Online
    • Journal articles
    • View Item
    • Home
    • Griffith Research Online
    • Journal articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

  • All of Griffith Research Online
    • Communities & Collections
    • Authors
    • By Issue Date
    • Titles
  • This Collection
    • Authors
    • By Issue Date
    • Titles
  • Statistics

  • Most Popular Items
  • Statistics by Country
  • Most Popular Authors
  • Support

  • Contact us
  • FAQs
  • Admin login

  • Login
  • FPT-Algorithms for Minimum-Bends Tours

    Thumbnail
    View/Open
    64445_1.pdf (908.6Kb)
    Author(s)
    Estivill-Castro, Vladimir
    Heednacram, Apichat
    Suraweera, Francis
    Griffith University Author(s)
    Suraweera, Francis
    Heednacram, Apichat
    Estivill-Castro, Vladimir
    Year published
    2011
    Metadata
    Show full item record
    Abstract
    This paper discusses the ?-BENDS TRAVELING SALESMAN PROBLEM. In this NP-complete problem, the inputs are n points in the plane and a positive integer ?, and we are asked whether we can travel in straight lines through these n points with at most ? bends. There are a number of applications where minimizing the number of bends in the tour is desirable because bends are considered very costly. We prove that this problem is fixed-parameter tractable (FPT). The proof is based on the kernelization approach. We also consider the RECTILINEAR ?-BENDS TRAVELING SALESMAN PROBLEM, which requires that the line-segments be axis-parallel. ...
    View more >
    This paper discusses the ?-BENDS TRAVELING SALESMAN PROBLEM. In this NP-complete problem, the inputs are n points in the plane and a positive integer ?, and we are asked whether we can travel in straight lines through these n points with at most ? bends. There are a number of applications where minimizing the number of bends in the tour is desirable because bends are considered very costly. We prove that this problem is fixed-parameter tractable (FPT). The proof is based on the kernelization approach. We also consider the RECTILINEAR ?-BENDS TRAVELING SALESMAN PROBLEM, which requires that the line-segments be axis-parallel. [note: An earlier version of the Rectilinear ?-Bends Traveling Salesman Problem has been published in COCOON 2010.]1 Note that a rectilinear tour with ? bends is a cover with ?-line segments, and therefore a cover by lines. We introduce two types of constraints derived from the distinction between line-segments and lines. We derive FPT-algorithms with different techniques and improved time complexity for these cases.
    View less >
    Journal Title
    International Journal of Computational Geometry and Applications (IJCGA)
    Volume
    21
    Issue
    2
    DOI
    https://doi.org/10.1142/S0218195911003615
    Copyright Statement
    Electronic version of an article published in International Journal of Computational Geometry and Applications (IJCGA), Vol. 21(2), 2011, pp. 189-213, http://dx.doi.org/10.1142/S0218195911003615. Copyright World Scientific Publishing Company http://www.worldscinet.com/ijcga/ijcga.shtml
    Subject
    Theory of computation
    Publication URI
    http://hdl.handle.net/10072/39781
    Collection
    • Journal articles

    Footer

    Disclaimer

    • Privacy policy
    • Copyright matters
    • CRICOS Provider - 00233E
    • TEQSA: PRV12076

    Tagline

    • Gold Coast
    • Logan
    • Brisbane - Queensland, Australia
    First Peoples of Australia
    • Aboriginal
    • Torres Strait Islander