Is it FPT to cover points with tours on minimum number of bends (Errata)?

  • Authors
  • Estivill-Castro V
  • UPF authors
  • ESTIVILL CASTRO, VLADIMIR;
  • Type
  • Scholarly articles
  • Journal títle
  • International Journal of Computational Geometry and Applications
  • Publication year
  • 2015
  • Volume
  • 25
  • Number
  • 1
  • Pages
  • 11-14
  • ISSN
  • 0218-1959
  • Publication State
  • Published
  • Abstract
  • apos;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.
  • Complete citation
  • Estivill-Castro V. Is it FPT to cover points with tours on minimum number of bends (Errata)?. International Journal of Computational Geometry and Applications 2015; 25(1): 11-14.
Bibliometric indicators
  • 0 times cited Scopus
  • Índex Scimago de 0.796 (2015)