论文信息 - Approximation algorithms for maximum dispersion

Approximation algorithms for maximum dispersion

We describe approximation algorithms with bounded performance guarantees for the following problem: A graph is given with edge weights satisfying the triangle inequality, together with two numbers k and p. Find k disjoint subsets of p vertices each, so that the total weight of edges within subsets is maximized

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

[2] Manuel Blum,et al. Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[3] B. Korte,et al. An Analysis of the Greedy Heuristic for Independence Systems , 1978 .

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

[5] Jay B. Ghosh,et al. Computational aspects of the maximum diversity problem , 1996, Oper. Res. Lett..

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

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

[8] Harold N Gabow,et al. An Efficient Implementation of Edmonds' Algorithm for Maximum Weight Matching on Graphs ; CU-CS-075-75 , 1975 .

[9] Harold N. Gabow,et al. An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs , 1976, JACM.

[10] 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 .

[11] Hisao Tamaki,et al. Greedily Finding a Dense Subgraph , 1996, J. Algorithms.

[12] Thomas A. Feo,et al. A class of bounded approximation algorithms for graph partitioning , 1990, Networks.

[13] Harold N. Gabow,et al. Data structures for weighted matching and nearest common ancestors with linking , 1990, SODA '90.