A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
- 1 June 2009
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Computational Geometry & Applications
- Vol. 19 (03) , 267-288
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Handbook of Discrete and Computational Geometry, Second Edition2004
- Approximation of Geometric Dispersion ProblemsAlgorithmica, 2001
- Heuristic and Special Case Algorithms for Dispersion ProblemsOperations Research, 1994
- Randomized incremental construction of abstract Voronoi diagramsComputational Geometry, 1993
- A study on two geometric location problemsInformation Processing Letters, 1988
- Improved algorithms for discs and balls using power diagramsJournal of Algorithms, 1988
- Approximation schemes for covering and packing problems in image processing and VLSIJournal of the ACM, 1985
- An optimal algorithm for constructing the weighted voronoi diagram in the planePattern Recognition, 1984
- Optimal packing and covering in the plane are NP-completeInformation Processing Letters, 1981