Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
From MaRDI portal
Publication:3652190
DOI10.1007/978-3-642-10631-6_7zbMath1272.68150OpenAlexW1835923762MaRDI QIDQ3652190
Stephane Durocher, Reza Dorrigiv, Francisco Claude, Robert Fraser, Alejandro Salinger, Alejandro López-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
Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Approximation algorithms (68W25)
Related Items (5)
Algorithms for the line-constrained disk coverage and related problems ⋮ The within-strip discrete unit disk cover problem ⋮ Algorithms for the line-constrained disk coverage and related problems ⋮ A constant-factor approximation algorithm for red-blue set cover with unit disks ⋮ A constant-factor approximation algorithm for red-blue set cover with unit disks
This page was built for publication: Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
