Covering Many or Few Points with Unit Disks

DOI10.1007/11970125_5MaRDI QIDQ5443509zbMATH OpenOpenAlexFDO

Authors S. Cabello, Mark de Berg, Sariel Har-Peled

Publication date 21 February 2008

Published in Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11970125_5

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Continuous location (90B85)

Recommendations

• Covering many or few points with unit disks
• Unit disk cover problem in 2D
• Covering Points by Unit Disks of Fixed Location
• On the discrete unit disk cover problem
• On the discrete unit disk cover problem

Cited in

(14)

• How many intervals cover a point in Dvoretzky covering?
• Facility location with tree topology and radial distance constraints
• Assigning weights to minimize the covering radius in the plane
• Covering many or few points with unit disks
• Covering point sets with two disjoint disks or squares
• Near-linear time approximation schemes for geometric maximum coverage
• Output sensitive algorithm for covering many points
• On isolating points using unit disks
• Fuzzy disk for covering fuzzy points
• On Isolating Points Using Disks
• Covering a Euclidean line or hyperplane by dilations of its discretization
• Approximation algorithms for finding maximum containing circle and sphere
• Multiple coverings of the farthest-off points with small density from projective geometry
• Enclosing weighted points with an almost-unit ball

This page was built for publication: Covering Many or Few Points with Unit Disks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5443509)