Is It FPT to Cover Points with Tours on Minimum Number of Bends (Errata)?

DOI10.1142/s0218195915500028zbMath1343.65019OpenAlexW2260708800MaRDI QIDQ2950590

Vladimir Estivill-Castro

Publication date: 9 October 2015

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

Full work available at URL: https://doi.org/10.1142/s0218195915500028

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)

Cites Work

• Minimum-link watchman tours
• Rectilinear paths among rectilinear obstacles
• FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS
• SHORTEST PATH QUERIES IN RECTILINEAR WORLDS
• 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: Is It FPT to Cover Points with Tours on Minimum Number of Bends (Errata)?