FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS

DOI10.1142/S0218195911003615zbMath1215.65037WikidataQ58803139 ScholiaQ58803139MaRDI QIDQ2999094

Francis Suraweera, Apichat Heednacram, 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)

Related Items (3)

Parameterized analysis and crossing minimization problems ⋮ Is It FPT to Cover Points with Tours on Minimum Number of Bends (Errata)? ⋮ On Covering Points with Minimum Turns

Cites Work

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

This page was built for publication: FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS