FPT-algorithms for minimum-bends tours

DOI10.1142/S0218195911003615MaRDI QIDQ2999094zbMATH OpenWikidataFDO

Authors Apichat Heednacram, Francis Suraweera, Vladimir Estivill-Castro

Publication date 11 May 2011

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

computational geometryfixed-parameter tractablecovering with hyperplanesminimum-bends tours

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• The rectilinear \(k\)-bends TSP
• scientific article; zbMATH DE number 1757971
• Is it FPT to cover points with tours on minimum number of bends (errata)?
• Improved FPT Algorithms for Rectilinear k-Links Spanning Path
• On covering points with minimum turns

Cites work

• COVERING A SET OF POINTS WITH A MINIMUM NUMBER OF TURNS
• Covering things with things
• Minimum-link watchman tours
• On the complexity of locating linear facilities in the plane
• Optimal Covering Tours with Turn Costs
• Rectilinear paths among rectilinear obstacles
• The Euclidean traveling salesman problem is NP-complete
• The exact fitting problem in higher dimensions
• The traveling salesman problem. A computational study.
• Traversing a set of points with a minimum number of turns

Cited in

(7)

• On Covering Points with Minimum Turns
• The rectilinear \(k\)-bends TSP
• Parameterized analysis and crossing minimization problems
• On covering points with minimum turns
• FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs
• scientific article; zbMATH DE number 1757971 (Why is no real title available?)
• Is it FPT to cover points with tours on minimum number of bends (errata)?

This page was built for publication: FPT-algorithms for minimum-bends tours

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999094)