Abstract
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 in polynomial time, unless P=NP. We give a 2/3 approximation algorithm for one version of the geometric dispersion problem. This algorithm is strongly polynomial in the size of the input, i.e., its running time does not depend on the area of P. We also discuss extensions and open problems.
This work was supported by the German Federal Ministry of Education, Science, Research and Technology (BMBF, Förderkennzeichen 01 IR 411 C7).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
B. S. Baker, D. J. Brown and H. K. Katseff. A 5/4 algorithm for two-dimensional packing, Journal of Algorithms, 2, 1981, 348–368.
Christoph Baur. Packungs-und Dispersionsprobleme. Diplomarbeit, Mathematisches Institut, UniversitÄt zu Köln, 1997.
J. E. Beasley. An exact two-dimensional non-guillotine cutting tree search procedure, Operations Research, 33, 1985, 49–64.
M. Bern and D. Eppstein. Clustering. Section 8.5 of the chapter Approximation algorithms for geometric problems, in: D. Hochbaum (ed.): Approximation Algorithms for NP-hard Problems. PWS Publishing, 1996.
B. K. Bhattacharya and M. E. Houle. Generalized maximum independent set for trees. To appear in: Journal of Graph Algorithms and Applications, 1997. mike@cs.newcastle.edu.au.
R. Chandrasekaran and A. Daughety. Location on tree networks: p-centre and n-dispersion problems. Mathematics of Operations Research, 6, 1981, 50–57.
R. L. Church and R. S. Garfinkel. Locating an obnoxious facility on a network. Transportation Science, 12, 1978, 107–118.
P. Duchet, Y. Hamidoune, M. Las Vergnas, and H. Meyniel. Representing a planar graph by vertical lines joining different levels. Discrete Mathematics, 46, 1983, 319–321.
E. Erkut. The discrete p-dispersion problem. European Journal of Operational Research, 46, 1990, 48–60.
E. Erkut and S. Neumann. Comparison of four models for dispersing facilities. European Journal of Operations Research, 40, 1989, 275–291.
S. P. Fekete and J. Schepers. A new exact algorithm for general orthogonal d-dimensional knapsack problems. Algorithms—ESA '97, Springer Lecture Notes in Computer Science, vol. 1284, 1997, 144–156.
S. P. Fekete and J. Schepers. On more-dimensional packing I: Modeling. Technical report, ZPR 97-288. Available at http://www.zpr.uni-koeln.de/~paper
S. P. Fekete and J. Schepers. On more-dimensional packing II: Bounds. Technical report, ZPR 97-289. Available at http://www.zpr.uni-koeln.de/~paper
S. P. Fekete and J. Schepers. On more-dimensional packing III: Exact Algorithms. Technical report, ZPR 97-290. Available at http://www.zpr.uni-koeln.de/~paper
R. J. Fowler, M. S. Paterson, and S. L. Tanimoto. Optimal packing and covering in the plane are NP-complete. Information Processing Letters, 12, 1981, 133–137.
Z. Füredi. The densest packing of equal circles into a parallel strip. Discrete & Computational Geometry, 1991, 95–106.
M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the theory of NP-Completeness. W. H. Freeman and Company, San Francisco, 1979.
A. J. Goldmann and P. M. Dearing. Concepts of optimal locations for partially noxious facilities. Bulletin of the Operational Research Society of America. 23, B85, 1975.
R. L. Graham and B. D. Lubachevsky. Dense packings of equal disks in an equilateral triangle: from 22 to 34 and beyond. The Electronic Journal of Combinatorics, 2, 1995, #A1.
R. L. Graham and B. D. Lubachevsky. Repeated patterns of dense packings of equal disks in a square. The Electronic Journal of Combinatorics 3, 1996, #R16.
R. L. Graham, B. D. Lubachevsky, K. J. Nurmela, and P. R. J. östergård. Dense packings of congruent circles in a circle. Manuscript, 1996. bdl@research.att.com.
E. Hadjiconstantinou and N. Christofides. An exact algorithm for general, orthogonal, two-dimensional knapsack problems, European Journal of Operations Research, 83, 1995, 39–56.
D. S. Hochbaum and W. Maass. Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM, 32, 1985, 130–136.
C. Kenyon and E. Remila, Approximate strip packing. Proc. of the 37th Annual Symposium on Foundations of Computer Science (FOCS 96), 142–154.
D. Lichtenstein. Planar formulae and their uses. SIAM Journal on Computing, 11, 1982, 329–343.
Z. Li and V. Milenkovic. A compaction algorithm for non-convex polygons and its application. Proc. of the Ninth Annual Symposium on Computational Geometry, 1993, 153–162.
B. D. Lubachevsky and R. L. Graham. Curved hexagonal packings of equal disks in a circle. Manuscript. bdl@research.att.com.
B. D. Lubachevsky, R. L. Graham, and F. H. Stillinger. Patterns and structures in disk packings. 3rd Geometry Festival, Budapest, Hungary, 1996. Manuscript. bdl@research.att.com.
C. D. Maranas, C. A. Floudas, and P. M. Pardalos. New results in the packing of equal circles in a square. Discrete Mathematics 142, 1995, 287–293.
M. V. Marathe, H. Breu, H. B. Hunt III, S. S. Ravi, and D. J. Rosenkrantz. Simple heuristics for unit disk graphs. Networks, 25, 1995, 59–68.
S. Martello and P. Toth, Knapsack Problems — Algorithms and Computer Implementations, Wiley, Chichester, 1990.
I.D. Moon and A. J. Goldman. Tree location problems with minimum separation. Transactions of the Institute of Industrial Engineers, 21, 1989, 230–240.
J. S. B. Mitchell, Y. Lin, E. Arkin, and S. Skiena. Stony Brook Computational Geometry Problem Seminar. Manuscript. jsbm@ams.sunysb.edu.
J. Neli\en. New approaches to the pallet loading problem. Technical Report, RWTH Aachen, Lehrstuhl für Angewandte Mathematik, 1993.
S. S. Ravi, D. J. Rosenkrantz, and G. K. Tayi. Heuristic and special case algorithms for dispersion problems. Operations Research, 42, 1994, 299–310.
D. J. Rosenkrantz, G. K. Tayi, and S. S. Ravi. Capacitated facility dispersion problems. Manuscript, submitted for publication, 1997. ravi@cs.albany.edu.
P. Rosenstiehl and R. E. Tarjan. Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete & Computational Geometry, 1, 1986, 343–353.
J. Schepers. Exakte Algorithmen für orthogonale Packungsprobleme. Dissertation, Mathematisches Institut, UniversitÄt zu Köln, 1997.
A. Tamir. Obnoxious facility location on graphs. SIAM Journal on Discrete Mathematics, 4, 1991, 550–567.
M. Wottawa. Struktur und algorithmische Behandlung von praxisorientierten dreidimensionalen Packungsproblemen. Dissertation, Mathematisches Institut, UniversitÄt zu Köln, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baur, C., Fekete, S.P. (1998). Approximation of geometric dispersion problems. In: Jansen, K., Rolim, J. (eds) Approximation Algorithms for Combinatiorial Optimization. APPROX 1998. Lecture Notes in Computer Science, vol 1444. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053964
Download citation
DOI: https://doi.org/10.1007/BFb0053964
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64736-2
Online ISBN: 978-3-540-69067-2
eBook Packages: Springer Book Archive