Show simple item record

dc.contributor.authorEstivill-Castro, Vladimir
dc.contributor.authorHeednacram, Apichat
dc.contributor.authorSuraweera, Francis
dc.date.accessioned2017-05-03T14:16:05Z
dc.date.available2017-05-03T14:16:05Z
dc.date.issued2011
dc.date.modified2011-10-20T06:39:30Z
dc.identifier.issn0218-1959
dc.identifier.doi10.1142/S0218195911003615
dc.identifier.urihttp://hdl.handle.net/10072/39781
dc.description.abstractThis 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.
dc.description.peerreviewedYes
dc.description.publicationstatusYes
dc.format.extent930434 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglish
dc.language.isoen_AU
dc.publisherWorld Scientific Publishing
dc.publisher.placeSingapore
dc.relation.ispartofstudentpublicationN
dc.relation.ispartofpagefrom189
dc.relation.ispartofpageto213
dc.relation.ispartofissue2
dc.relation.ispartofjournalInternational Journal of Computational Geometry and Applications (IJCGA)
dc.relation.ispartofvolume21
dc.rights.retentionY
dc.subject.fieldofresearchAnalysis of Algorithms and Complexity
dc.subject.fieldofresearchComputation Theory and Mathematics
dc.subject.fieldofresearchArtificial Intelligence and Image Processing
dc.subject.fieldofresearchcode080201
dc.subject.fieldofresearchcode0802
dc.subject.fieldofresearchcode0801
dc.titleFPT-Algorithms for Minimum-Bends Tours
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
gro.facultyGriffith Sciences, School of Information and Communication Technology
gro.rights.copyrightElectronic 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
gro.date.issued2011
gro.hasfulltextFull Text
gro.griffith.authorSuraweera, Francis
gro.griffith.authorHeednacram, Apichat
gro.griffith.authorEstivill-Castro, Vladimir


Files in this item

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record