NP-completeness and FPT Results for Rectilinear Covering Problems

@article{EstivillCastro2010NPcompletenessAF,
  title={NP-completeness and FPT Results for Rectilinear Covering Problems},
  author={Vladimir Estivill-Castro and Apichat Heednacram and Francis Suraweera},
  journal={J. UCS},
  year={2010},
  volume={16},
  pages={622-652}
}
This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover where the inputs are n points in R and a positive integer k, and we are asked to answer if we can cover these n points with at most k lines where these lines are restricted to be axis parallel. We show that this problem has efficient fixed-parameter tractable (FPT) algorithms. The second problem is the Rectilinear k-Links Spanning… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 23 references

Covering Things with Things

Discrete & Computational Geometry • 2005
View 7 Excerpts
Highly Influenced

On the complexity of locating linear facilities in the plane

N. Megiddo, A. Tamir
Operations Research Letters • 1982
View 4 Excerpts
Highly Influenced

Approximation algorithms for hitting objects with straight lines

Discrete Applied Mathematics • 1991
View 3 Excerpts
Highly Influenced

Invitation to Fixed-Parameter Algorithms, Oxford Lecture Series in Mathematics and its Applications 31

R. Niedermeier
2006
View 1 Excerpt

Parameterized Complexity Theory

Texts in Theoretical Computer Science. An EATCS Series • 2006
View 1 Excerpt

Path Planning Algorithms under the Link-Distance Metric

D. Wagner
PhD thesis, Dartmouth College, • 2006
View 2 Excerpts

Restricted-Orientation Convexity

Monographs in Theoretical Computer Science. An EATCS Series • 2004
View 1 Excerpt

Similar Papers

Loading similar papers…