A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Approximation of geometric dispersion problems
[chapter]
1998
Lecture Notes in Computer Science
We consider problems of distributing a number of points within a connected polygonal domain P, such that the points are "far away" from each other. Problems of this type have been considered before for the case where the possible locations form a discrete set. Dispersion problems are closely related to packing problems. While Hochbaum and Maass (1985) have given a polynomial time approximation scheme for packing, we show that geometric dispersion problems cannot be approximated arbitrarily well
doi:10.1007/bfb0053964
fatcat:exwq7qjnoffxrnuxmjnjc7w4be