Approximation algorithms for maximum dispersion

Operations Research Letters

Volumn 21, Issue 3, 1997, Pages 133-137

  Hassin, Refael ^a   Rubinstein, Shlomi ^a   Tamir, Arie ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximation algorithms; Facility location; Maximum dispersion

Indexed keywords

EID: 0012826421     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(97)00034-5     Document Type: Article

References (12)

1. Y. Asahiro, K. Iwama, H. Tamaki, T. Tokuyama, Greedily finding a dense graph, in: Proc. 5th Scandinavian Workshop on Algorithm Theory (SWAT), Lecture Notes in Computer Science, vol. 1097, Springer, Berlin, 1996, pp. 136-148.
2. M. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest, R.E. Tarjan, Time bounds for selection, J. Comput. System Sci. 7 (1972) 448-461.
3. B. Chandra, M. Halldórsson, Facility dispersion and remote subgraphs, in: Proc. 5th Scandinavian Workshop on Algorithm Theory (SWAT), Lecture Notes in Computer Science, vol. 1097, Springer, Berlin, 1996, pp. 53-65.
4. T.A. Feo, M. Khellaf, A class of bounded approximation algorithms for graph partitioning, Networks 20 (1990) 181-195.
5. H.N. Gabow, An efficient implementation of Edmond's algorithm for maximum matchings on graphs, J. ACM 23 (1975) 221-234.
6. H.N. Gabow, Data structures for weighted matching and nearest common ancestors with linking, in: Proc. 1st Ann. ACM-SIAM Symp. on Discrete Algebra 1990, pp. 434-443.
7. J.B. Ghosh, Computational aspects of the maximum diversity problem, Oper. Res. Lett. 19 (1996) 175-181.
8. B. Korte, D. Hausmann, An analysis of the greedy heuristic for independence systems, Ann. Discrete Math. 2 (1978) 65-74.
9. G. Kortsarz, D. Peleg, On choosing a dense subgraph, in: Proc. 34th IEEE Ann. Symp. on Foundations of Computer Science, Palo Alto, CA, 1993, pp. 692-701.
10. S.S. Ravi, D.J. Rosenkrantz, G.K. Tayi, Heuristic and special case algorithms for dispersion problems, Oper. Res. 42 (1994) 299-310.
11. A. Tamir, Obnoxious facility location on graphs, SIAM J. Discrete Math. 4 (1991) 550-567.
12. A. Tamir, Comments on the paper: 'Heuristic and special case algorithms for dispersion problems' by S.S. Ravi, D.J. Rosenkrantz and G.K. Tayi, Oper. Res., to appear.