Abstract
Dispersion problems involve arranging a set of points as far away from each other as possible. They have numerous applications in the location of facilities and in management decision science. We present several algorithms and hardness results for dispersion problems using different natural measures of remoteness, some of which have been studied previously in the literature and others which we introduce; in particular, we give the first algorithm with a non-trivial performance guarantee for the problem of locating a set of points such that the sum of their distances to their nearest neighbor in the set is maximized.
Work of both authors performed in large part at JAIST-Hokuriku, Japan.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Bellare and M. Sudan. Improved non-approximability results. STOC 1994.
E. Erkut. The discrete p-dispersion problem. Europ. J. Oper. Res, 46:48–60, 1990.
E. Erkut and S. Neuman. Analytical models for locating undesirable facilities. Europ. J. Oper. Res, 40:275–291, 1989.
E. Erkut and S. Neuman. Comparison of four models for dispersing facilities. INFOR, 29:68–85, 1990.
M. M. Halldörsson, K. Iwano, N. Katoh, and T. Tokuyama. Finding subsets maximizing minimum structures. SODA 1995.
R. Hassin, S. Rubinstein, and A. Tamir. Notes on dispersion problems. Dec. 1994.
G. Kortsarz and D. Peleg. On choosing a dense subgraph. FOCS 1993.
M. J. Kuby. Programming models for facility dispersion: The p-dispersion and maxisum dispersion problems. Geog. Anal., 19(4):315–329, Oct. 1987.
I. D. Moon and S. S. Chaudhry. An analysis of network location problems with distance constraints. Mgmt. Science, 30(3):290–307, Mar. 1984.
S. S. Ravi, D. J. Rosenkrantz, and G. K. Tayi. Heuristic and special case algorithms for dispersion problems. Op. Res, 42(2):299–310, 1994.
A. Tamir. Obnoxious facility location on graphs. SIAM J. Disc. Math., 4(4):550–567, Nov. 1991.
D. J. White. The maximal dispersion problem and the “first point outside the neighborhood” heuristic. Computers Ops. Res., 18(1):43–50, 1991.
D. J. White. The maximal dispersion problem. J. Applic. Math, in Bus. and Ind., 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chandra, B., Halldórsson, M.M. (1996). Facility dispersion and remote subgraphs. In: Karlsson, R., Lingas, A. (eds) Algorithm Theory — SWAT'96. SWAT 1996. Lecture Notes in Computer Science, vol 1097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61422-2_120
Download citation
DOI: https://doi.org/10.1007/3-540-61422-2_120
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61422-7
Online ISBN: 978-3-540-68529-6
eBook Packages: Springer Book Archive