Maximum Dispersion and Geometric Maximum Weight Cliques

Abstract We consider a facility location problem, where the objective is to “disperse” a number of facilities, i.e., select a given number k of locations from a discrete set of n candidates, such that the average distance between selected locations is maximized. In particular, we present algorithmic results for the case where vertices are represented by points in d-dimensional space, and edge weights correspond to rectilinear distances. Problems of this type have been considered before, with the best result being an approximation algorithm with performance ratio 2. For the case where k is fixed, we establish a linear-time algorithm that finds an optimal solution. For the case where k is part of the input, we present a polynomial-time approximation scheme.

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

[2]  Barun Chandra,et al.  Facility Dispersion and Remote Subgraphs , 1995, SWAT.

[3]  Anand Srivastav,et al.  Finding Dense Subgraphs with Semidefinite Programming , 1998, APPROX.

[4]  Michael A. Trick,et al.  Comments on the Paper: 'Heuristic and Special Case Algorithms for Dispersion Problems' by S. S. Ravi, D. J. Rosenkrantz and G. K. Tayi , 1998 .

[5]  Guy Kortsarz,et al.  On choosing a dense subgraph , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[6]  Uriel Feige,et al.  The Dense k -Subgraph Problem , 2001, Algorithmica.

[7]  Peter Gritzmann,et al.  Largestj-simplices inn-polytopes , 1995, Discret. Comput. Geom..

[8]  Refael Hassin,et al.  Approximation algorithms for maximum dispersion , 1997, Oper. Res. Lett..

[9]  Evripidis Bampis,et al.  Approximation schemes for minimizing average weighted completion time with release dates , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

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

[11]  Refael Hassin,et al.  Complexity of finding dense subgraphs , 2002, Discret. Appl. Math..

[12]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[13]  U. Feige,et al.  On the densest k-subgraph problems , 1997 .

[14]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

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

[16]  Friedrich Eisenbrand,et al.  On the Chvátal Rank of Polytopes in the 0/1 Cube , 1999, Discret. Appl. Math..

[17]  Yuichi Asahiroa,et al.  Complexity of nding dense subgraphs , 2002 .

[18]  Sándor P. Fekete,et al.  Approximation of Geometric Dispersion Problems , 1998, Algorithmica.

[19]  Peter Gritzmann,et al.  Largest j-Simplices in n-Polytopes , 1994, Universität Trier, Mathematik/Informatik, Forschungsbericht.

[20]  Lars Engebretsen,et al.  Clique Is Hard To Approximate Within , 2000 .

[21]  Barun Chandra,et al.  Approximation Algorithms for Dispersion Problems , 2001, J. Algorithms.