On the discrete unit disk cover problem

DOI10.1142/S0218195912500094MaRDI QIDQ5300002zbMATH OpenFDO

Authors Robert Fraser, Bradford G. Nickerson, Gautam K. Das, Alejandro Lopez-Ortiz

Publication date 24 June 2013

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmsgeometric set coverdiscrete unit disk cover

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Combinatorial complexity of geometric structures (52C45) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Recommendations

• On the discrete unit disk cover problem
• Covering Points by Unit Disks of Fixed Location
• Unit disk cover problem in 2D
• An improved line-separable algorithm for discrete unit disk cover
• Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm

Cites work

• A Greedy Heuristic for the Set-Covering Problem
• Almost optimal set covers in finite VC-dimension
• An improved line-separable algorithm for discrete unit disk cover
• Approximation schemes for covering and packing problems in image processing and VLSI
• Covering a set of points in multidimensional space
• Exact and approximation algorithms for clustering
• Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
• Improved results on geometric hitting set problems
• Optimal packing and covering in the plane are NP-complete
• The NP-completeness column: An ongoing guide
• The searching over separators strategy to solve some NP-hard problems in subexponential time

Cited in

(29)

• Approximation algorithms for the unit disk cover problem in 2D and 3D
• Line segment disk cover
• Tighter estimates for -nets for disks
• Algorithms for the line-constrained disk coverage and related problems
• Algorithms for the line-constrained disk coverage and related problems
• Capacitated discrete unit disk cover
• Capacitated discrete unit disk cover
• Covering Points by Unit Disks of Fixed Location
• Covering many or few points with unit disks
• A 4.31-approximation for the geometric unique coverage problem on unit disks
• Identification of points using disks
• Discrete unit square cover problem
• Unit disk cover problem in 2D
• An improved line-separable algorithm for discrete unit disk cover
• Parallel algorithm for minimum partial dominating set in unit disk graph
• Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph
• Minimum dominating set problem for unit disks revisited
• A PTAS for the Weighted Unit Disk Cover Problem
• On the discrete unit disk cover problem
• Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
• Covering Many or Few Points with Unit Disks
• Approximation algorithms for minimum ply covering of points with unit squares and unit disks
• A constant-factor approximation for multi-covering with disks
• Two optimization problems for unit disks
• APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS
• Experiments with unit disk cover algorithms for covering massive pointsets
• An exact algorithm for a class of geometric set-cover problems
• Limits of local search: quality and efficiency
• The within-strip discrete unit disk cover problem

This page was built for publication: On the discrete unit disk cover problem

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