Covering a Set of Points with a Minimum Number of Lines
From MaRDI portal
Recommendations
Cited in
(24)- Economical coverings of sets of lattice points
- Lower bounds for covering problems
- Covering paths for planar point sets
- How many translates of a small set are needed to cover the line?
- Covering Points with Convex Sets of Minimum Size
- Applications of incidence bounds in point covering problems
- covering grid points in a convex polygon with straight lines∗
- A parameterized algorithm for the hyperplane-cover problem
- Approximation algorithms for a geometric set cover problem
- Digital straightness, circularity, and their applications to image analysis
- Improved parameterized algorithms for minimum link-length rectilinear spanning path problem
- COVERING A SET OF POINTS WITH A MINIMUM NUMBER OF TURNS
- scientific article; zbMATH DE number 4197287 (Why is no real title available?)
- Reduction rules deliver efficient FPT-algorithms for covering points with lines
- Slightly superexponential parameterized problems
- On Covering Points with Minimum Turns
- Traversing a set of points with a minimum number of turns
- Traversing a set of points with a minimum number of turns
- Searching for Point Locations Using Lines
- Geometric covering number: covering points with curves
- Nearly time-optimal kernelization algorithms for the line-cover problem with big data
- An improved bound for plane covering paths
- On the approximability of covering points by lines and related problems
- Covering a set of points in a plane using two parallel rectangles
This page was built for publication: Covering a Set of Points with a Minimum Number of Lines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434538)
