Corpus ID: 227305594

Near-Optimal Algorithms for Point-Line Covering Problems

@article{Chen2020NearOptimalAF,
title={Near-Optimal Algorithms for Point-Line Covering Problems},
author={J. Chen and Qin Huang and Iyad A. Kanj and Ge Xia},
journal={ArXiv},
year={2020},
volume={abs/2012.02363}
}
• J. Chen, +1 author Ge Xia
• Published 2020
• Computer Science, Mathematics
• ArXiv
We study fundamental point-line covering problems in computational geometry, in which the input is a set $S$ of points in the plane. The first is the Rich Lines problem, which asks for the set of all lines that each covers at least $\lambda$ points from $S$, for a given integer parameter $\lambda \geq 2$; this problem subsumes the 3-Points-on-Line problem and the Exact Fitting problem, which -- the latter -- asks for a line containing the maximum number of points. The second is the NP-hard… Expand

References

SHOWING 1-10 OF 52 REFERENCES
Covering a Set of Points with a Minimum Number of Lines
• Mathematics, Computer Science
• CIAC
• 2006
• 26
• Highly Influential
• PDF
Applications of incidence bounds in point covering problems
• Mathematics, Computer Science
• Symposium on Computational Geometry
• 2016
• 8
• PDF
Reduction rules deliver efficient FPT-algorithms for covering points with lines
• Mathematics, Computer Science
• JEAL
• 2010
• 6
• Highly Influential
• PDF
Hardness of Set Cover with Intersection 1
• Mathematics, Computer Science
• ICALP
• 2000
• 79
• PDF
Fpt-Algorithms for Minimum-Bends Tours
• Computer Science
• Int. J. Comput. Geom. Appl.
• 2011
• 8
• PDF
A parameterized algorithm for the hyperplane-cover problem
• Mathematics, Computer Science
• Theor. Comput. Sci.
• 2010
• 16
• PDF
On the complexity of locating linear facilities in the plane
• Mathematics, Computer Science
• Oper. Res. Lett.
• 1982
• 187
Almost optimal set covers in finite VC-dimension
• Mathematics, Computer Science
• Discret. Comput. Geom.
• 1995
• 502
• PDF
A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope
• Mathematics, Computer Science
• Algorithmica
• 2007
• 4
• Highly Influential
• PDF