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