Approximation of geometric dispersion problems
Authors:
- 1 January 1998
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 63-75
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- New results in the packing of equal circles in a squareDiscrete Mathematics, 1995
- An exact algorithm for general, orthogonal, two-dimensional knapsack problemsEuropean Journal of Operational Research, 1995
- Simple heuristics for unit disk graphsNetworks, 1995
- Obnoxious Facility Location on GraphsSIAM Journal on Discrete Mathematics, 1991
- The discrete p-dispersion problemEuropean Journal of Operational Research, 1990
- Analytical models for locating undesirable facilitiesEuropean Journal of Operational Research, 1989
- Approximation schemes for covering and packing problems in image processing and VLSIJournal of the ACM, 1985
- Representing a planar graph by vertical lines joining different levelsDiscrete Mathematics, 1983
- A 54 algorithm for two-dimensional packingJournal of Algorithms, 1981
- Optimal packing and covering in the plane are NP-completeInformation Processing Letters, 1981