Applications of incidence bounds in point covering problems
From MaRDI portal
Publication:3132896
DOI10.4230/LIPICS.SOCG.2016.60zbMATH Open1387.68225arXiv1603.07282MaRDI QIDQ3132896FDOQ3132896
Authors: Peyman Afshani, Edvin Berglin, Ingo van Duijn, Jesper Sindahl Nielsen 
Publication date: 30 January 2018
Full work available at URL: https://arxiv.org/abs/1603.07282
Recommendations
- A parameterized algorithm for the hyperplane-cover problem
- Tight kernels for covering and hitting: point hyperplane cover and polynomial point hitting set
- Covering a Set of Points with a Minimum Number of Lines
- Reduction rules deliver efficient FPT-algorithms for covering points with lines
- Covering lattice points by subspaces and counting point-hyperplane incidences
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (13)
- Two theorems on point-flat incidences
- A parameterized algorithm for the hyperplane-cover problem
- Reduction rules deliver efficient FPT-algorithms for covering points with lines
- Extending Erdős-Beck's theorem to higher dimensions
- Geometric hitting set for segments of few orientations
- Nearly time-optimal kernelization algorithms for the line-cover problem with big data
- Modelling of ``green investments risks
- Kernelization of the subset general position problem in geometry
- On the approximability of covering points by lines and related problems
- Nondegenerate spheres in four dimensions
- Point line cover: the easy kernel is essentially tight
- Tight kernels for covering and hitting: point hyperplane cover and polynomial point hitting set
- Geometric covering number: covering points with curves
This page was built for publication: Applications of incidence bounds in point covering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132896)
