On covering points with minimum turns

Authors:
Minghui Jiang
Affiliations:
Department of Computer Science, Utah State University, Logan, UT
Venue:
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Year:
2012

Citing 9
Cited 1

Approximation algorithms for hitting objects with straight lines

Discrete Applied Mathematics
Angle-restricted tours in the plane

Computational Geometry: Theory and Applications
Improved lower bounds for the link length of rectilinear spanning paths in grids

Information Processing Letters
The Angular-Metric Traveling Salesman Problem

SIAM Journal on Computing
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem

Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Minimum-link watchman tours

Information Processing Letters
Covering Things with Things

Discrete & Computational Geometry
Optimal Covering Tours with Turn Costs

SIAM Journal on Computing
Note: A parameterized algorithm for the hyperplane-cover problem

Theoretical Computer Science

Covering paths for planar point sets

GD'12 Proceedings of the 20th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We point out mistakes in several previous FPT algorithms for k -Link Covering Tour and its variants in ℝ2, and show that the previous NP-hardness proofs for Minimum-Link Rectilinear Covering Tour and Minimum-Link Rectilinear Spanning Path in ℝ3 are incorrect. We then present new NP-hardness proofs for the two problems in ℝ10.