Approximation Algorithms for Dispersion Problems

Journal of Algorithms

Volumn 38, Issue 2, 2001, Pages 438-465

  Chandra, Barun ^a   Halldórsson, Magnús M ^b  

^a UNIVERSITY OF NEW HAVEN   (United States)

^b UNIVERSITY OF ICELAND   (Iceland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345856417     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1145     Document Type: Article

References (15)

1. C. Baur and S. Fekete, Approximation of geometric dispersion problems, Algorithmica, in press.
2. E. Erkut, The discrete p-dispersion problem, Europ. J. Oper. Res. 46 (1990), 48-60.
3. E. Erkut and S. Neuman, Analytical models for locating undesirable facilities. Europ. J. Oper. Res. 40 (1989), 275-291.
4. E. Erkut and S. Neuman, Comparison of four models for dispersing facilities, INFOR 29 (1990), 68-85.
5. U. Feige, G. Kortsarz, and D. Peleg, The dense k-subgraph problem. J. Algorithms in press.
6. M. M. Halldórsson, K. Iwano, N. Katoh, and T. Tokuyama, Finding subsets maximizing minimum structures, SIAM J. Disc. Math. 12 (1999), 342-359.
7. R. Hassin, S. Rubinstein, and A. Tamir, Approximation algorithms for maximum dispersion, OR Lett. 21 (1997), 133-137.
8. 1-∈. Acta Mathemat. 182 (1999), 105-142.
9. G. Kortsarz and D. Peleg, On choosing a dense subgraph, in Proc. 34th IEEE Symp. on Foundations of Computer Science, Nov. 1993, pp. 692-701.
10. M. J. Kuby, Programming models for facility dispersion: The p-dispersion and maxisum dispersion problems, Geog. Anal. 19 (1987), 315-329.
11. I. D. Moon and S. S. Chaudhry, An analysis of network location problems with distance constraints, Management Sci. 30 (1984), 290-307.
12. S. S. Ravi, D. J. Rosenkrantz, and G. K. Tayi, Heuristic and special case algorithms for dispersion problems, Oper. Res. 42 (1994), 299-310.
13. A. Tamir, Obnoxious facility location on graphs, SIAM J. Disc. Math. 4 (1991), 550-567.
14. A. Tamir, Comments on the paper "Heuristic and special case algorithms for dispersion problem" by S. S. Ravi, D. J. Rosenkrantz, and G. K. Tayi. Oper. Res. 46 (1998), 157-158.
15. D. J. White, The maximal dispersion problem and the "first point outside the neighborhood" heuristic. Comput. Ops. Res. 18 (1991), 43-50.