Approximation of Geometric Dispersion Problems

Abstract. We consider problems of distributing a number of points within a polygonal region 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 [20] 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. A special case of this observation solves an open problem by Rosenkrantz et al. [31]. 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.

[1]  Robert E. Tarjan,et al.  Rectilinear planar layouts and bipolar orientations of planar graphs , 1986, Discret. Comput. Geom..

[2]  Arie Tamir,et al.  Obnoxious Facility Location on Graphs , 1991, SIAM J. Discret. Math..

[3]  J. Nelissen.  New approaches to the pallet loading problem , 1993 .

[4]  S. S. Ravi,et al.  Heuristic and Special Case Algorithms for Dispersion Problems , 1994, Oper. Res..

[5]  S. S. Ravi,et al.  Facility Dispersion Problems Under Capacity and Cost Constraints , 2000, J. Comb. Optim..

[6]  R. Chandrasekaran,et al.  Location on Tree Networks: P-Centre and n-Dispersion Problems , 1981, Math. Oper. Res..

[7]  Frank Wagner,et al.  A packing problem with applications to lettering of maps , 1991, SCG '91.

[8]  Patric R. J. Östergård,et al.  Dense packings of congruent circles in a circle , 1998, Discret. Math..

[9]  Ronald L. Graham,et al.  Curved Hexagonal Packings of Equal Disks in a Circle , 1997, Discret. Comput. Geom..

[10]  John E. Beasley,et al.  An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure , 1985, Oper. Res..

[11]  E. Erkut,et al.  Comparison Of Four Models For dispersing Facilities , 1991 .

[12]  R. Garfinkel,et al.  Locating an Obnoxious Facility on a Network , 1978 .

[13]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[14]  Klara Kedem,et al.  On some geometric selection and optimization problems via sorted matrices , 1998, Comput. Geom..

[15]  Claire Mathieu,et al.  Approximate strip packing , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[16]  Zoltán Füredi.  The densest packing of equal circles into a parallel strip , 1991, Discret. Comput. Geom..

[17]  E. Erkut.  The discrete p-dispersion problem , 1990 .

[18]  Ronald L. Graham,et al.  Dense Packings of Equal Disks in an Equilateral Triangle: from 22 to 34 and Beyond , 1995, Electron. J. Comb..

[19]  Nicos Christofides,et al.  An exact algorithm for general, orthogonal, two-dimensional knapsack problems , 1995 .

[20]  Paul Erdös,et al.  On Packing Squares with Equal Squares , 1975, J. Comb. Theory, Ser. A.

[21]  Panos M. Pardalos,et al.  New results in the packing of equal circles in a square , 1995, Discret. Math..

[22]  Sándor P. Fekete,et al.  A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems , 1997, ESA.

[23]  Harry B. Hunt,et al.  Simple heuristics for unit disk graphs , 1995, Networks.

[24]  Robert J. Fowler,et al.  Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..

[25]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[26]  Ronald L. Graham,et al.  Repeated Patterns of Dense Packings of Equal Disks in a Square , 1996, Electron. J. Comb..

[27]  Ronald L. Graham,et al.  Patterns and Structures in Disk Packings , 1997 .

[28]  Yahya Ould Hamidoune,et al.  Representing a planar graph by vertical lines joining different levels , 1983, Discret. Math..

[29]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[30]  Zhenyu Li,et al.  A compaction algorithm for non-convex polygons and its application , 1993, SCG '93.

[31]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[32]  Wolfgang Maass,et al.  Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.

[33]  Danièle Beauquier,et al.  Tiling Figures of the Plane with Two Bars , 1995, Comput. Geom..

[34]  Brenda S. Baker,et al.  A 5/4 Algorithm for Two-Dimensional Packing , 1981, J. Algorithms.