Facility dispersion and remote subgraphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1097, Issue , 1996, Pages 53-65

  Chandra, Barun ^a   Hallddrsson, Magnfis M ^b  

^a Rice University   (United States)

^b UNIVERSITY OF ICELAND   (Iceland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

HARDNESS RESULT; MANAGEMENT DECISIONS; NATURAL MEASURE; NEAREST NEIGHBORS; NON-TRIVIAL; PERFORMANCE GUARANTEES; SUBGRAPHS;

DISPERSIONS;

EID: 84947921232     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61422-2_120     Document Type: Conference Paper

References (13)

1. M. Bellare and M. Sudan. Improved non-approximability results. STOC 1994.
2. E. Erkut. The discrete p-dispersion problem. Europ. J. Oper. Res, 46:48-60, 1990.
3. E. Erkut and S. Neuman. Analytical models for locating undesirable facilities. Europ. J. Oper. Res, 40:275-291, 1989.
4. E. Erkut and S. Neuman. Comparison of four models for dispersing facilities. INFOR, 29:68-85, 1990.
5. M. M. Halldörsson, K. Iwano, N. Katoh, and T. Tokuyama. Finding subsets maximizing minimum structures. SODA 1995.
6. R. Hassin, S. Rubinstein, and A. Tamir. Notes on dispersion problems. Dec. 1994.
7. G. Kortsarz and D. Peleg. On choosing a dense subgraph. FOCS 1993.
8. M. J. Kuby. Programming models for facility dispersion: The p-dispersion and maxisum dispersion problems. Geog. Anal., 19(4):315-329, Oct. 1987.
9. I. D. Moon and S. S. Chaudhry. An analysis of network location problems with distance constraints. Mgmt. Science, 30(3):290-307, Mar. 1984.
10. 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.
11. A. Tamir. Obnoxious facility location on graphs. SIAM J. Disc. Math., 4(4):550-567, Nov. 1991.
12. D. J. White. The maximal dispersion problem and the "first point outside the neighborhood" heuristic. Computers Ops. ges., 18(1):43-50, 1991.
13. D. J. White. The maximal dispersion problem. J. Applic. Math. in Bus. and Ind., 1992.