• 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
  • Is it FPT to cover points with tours on minimum number of bends (Errata)?

    Author(s)
    Estivill-Castro, V
    Griffith University Author(s)
    Estivill-Castro, Vladimir
    Year published
    2015
    Metadata
    Show full item record
    Abstract
    Recent communication by Minghui Jiang has brought to my attention that I overlooked faults in the arguments built while collaborating closely with my PhD student Apichat Heednacram and his co-supervisor Francis Suraweera. These errors unfortunately also escaped the scrutiny of peer-reviews and the formal process of examination. Some results in Apichat's dissertation that were published in this journal (and other outlets) are actually incorrect. In particular, we had reported an FPT-algorithms for the k-Bends Traveling Salesman Problem in 2 and some variants that result from adding constraints to the line-segments that ...
    View more >
    Recent communication by Minghui Jiang has brought to my attention that I overlooked faults in the arguments built while collaborating closely with my PhD student Apichat Heednacram and his co-supervisor Francis Suraweera. These errors unfortunately also escaped the scrutiny of peer-reviews and the formal process of examination. Some results in Apichat's dissertation that were published in this journal (and other outlets) are actually incorrect. In particular, we had reported an FPT-algorithms for the k-Bends Traveling Salesman Problem in 2 and some variants that result from adding constraints to the line-segments that constitute the tour. While the reduction rules to kernelize the problem produce reduced instances, a solution of the kernel instance does not lead directly to a solution of the original instance.
    View less >
    Journal Title
    International Journal of Computational Geometry and Applications
    Volume
    25
    Issue
    1
    DOI
    https://doi.org/10.1142/s0218195915500028
    Subject
    Theory of computation
    Publication URI
    http://hdl.handle.net/10072/408050
    Collection
    • Journal articles

    Footer

    Disclaimer

    • Privacy policy
    • Copyright matters
    • CRICOS Provider - 00233E

    Tagline

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