Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm

DOI10.1007/978-3-642-10631-6_7MaRDI QIDQ3652190zbMATH OpenOpenAlexFDO

Authors Francisco Claude, Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro Salinger, Alejandro Lopez-Ortiz

Publication date 17 December 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10631-6_7

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Recommendations

• An improved line-separable algorithm for discrete unit disk cover
• Algorithms for the line-constrained disk coverage and related problems
• Algorithms for the line-constrained disk coverage and related problems
• On the discrete unit disk cover problem
• On the discrete unit disk cover problem
• Approximation algorithms for the unit disk cover problem in 2D and 3D
• The within-strip discrete unit disk cover problem
• An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem
• Capacitated discrete unit disk cover
• Capacitated discrete unit disk cover

Cited in

(14)

• Experiments with unit disk cover algorithms for covering massive pointsets
• APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS
• On the discrete unit disk cover problem
• An improved line-separable algorithm for discrete unit disk cover
• Unit disk cover problem in 2D
• The within-strip discrete unit disk cover problem
• On the discrete unit disk cover problem
• Covering Points by Unit Disks of Fixed Location
• An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem
• Algorithms for the line-constrained disk coverage and related problems
• A constant-factor approximation algorithm for red-blue set cover with unit disks
• Algorithms for the line-constrained disk coverage and related problems
• A constant-factor approximation algorithm for red-blue set cover with unit disks
• Approximation algorithms for the unit disk cover problem in 2D and 3D

This page was built for publication: Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm

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