A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
From MaRDI portal
Publication:5322316
DOI10.1142/S0218195909002952zbMath1178.68673OpenAlexW2104589295MaRDI QIDQ5322316
Alexander Wolff, Marc Benkert, Joachim Gudmundsson, Christian Knauer, René van Oostrum
Publication date: 20 July 2009
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195909002952
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (5)
The dispersive art gallery problem ⋮ Dispersing points on intervals ⋮ Efficient Approximations for the Online Dispersion Problem ⋮ Dispersion in disks ⋮ Systems of distant representatives in Euclidean space
Cites Work
- Randomized incremental construction of abstract Voronoi diagrams
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- A study on two geometric location problems
- Optimal packing and covering in the plane are NP-complete
- Approximation schemes for covering and packing problems in image processing and VLSI
- Improved algorithms for discs and balls using power diagrams
- Heuristic and Special Case Algorithms for Dispersion Problems
- Approximation of geometric dispersion problems
This page was built for publication: A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
