COVERING A SET OF POINTS WITH A MINIMUM NUMBER OF TURNS

DOI10.1142/S021819590400138XzbMath1077.68069MaRDI QIDQ4818599

Michael J. Collins

Publication date: 29 September 2004

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

zbMATH Keywords

TSPrectilinearbendsturnslink-length

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Is It FPT to Cover Points with Tours on Minimum Number of Bends (Errata)? ⋮ Improved parameterized algorithms for minimum link-length rectilinear spanning path problem ⋮ FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS ⋮ Traversing a set of points with a minimum number of turns ⋮ Covering paths for planar point sets ⋮ On Covering Points with Minimum Turns

Uses Software

• AMPL

Cites Work

• Improved lower bounds for the link length of rectilinear spanning paths in grids

This page was built for publication: COVERING A SET OF POINTS WITH A MINIMUM NUMBER OF TURNS