Approximation algorithms for min-sum p-clustering

Discrete Applied Mathematics

Volumn 89, Issue 1-3, 1998, Pages 125-142

  Guttmann Beck, Nili ^a   Hassin, Refael ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximation algorithm; p clustering

Indexed keywords

EID: 0001225295     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00100-0     Document Type: Article

References (7)

1. N. Garg, V.V. Vazirani, M. Yannakakis, Approximate max-flow min-(multi)cut theorems and their applications, SIAM J. Comput. 25 (1995) 235-251.
2. J.A. Hartigan, Clustering Algorithms, New York, Wiley, 1975.
3. D.G. Kirkpatrick, P. Hell, On the completeness of a generalized min matching problem, Proc. 10th Ann. ACM Symposium Theory of Computing, 1978, pp. 240-245.
4. V. Kann, S. Khanna, J. Lagergren, A. Panconesi, On the hardness of approximating Max K-CUT and its dual, Israeli Symp. on Theory of Computing and Systems, 1996, pp. 61-67.
5. K.B. Lipkowitz, D.B. Boyd, Reviews in Computational Chemistry, vol. 7, VCH Publishers, New York, 1996.
6. S.K. Sahni, T.F. Gonzalez, P-complete approximation problems, J. ACM 23 (1976) 555-565.
7. T. Tokuyama, J. Nakano, Geometric algorithms for the minimum cost assignment problem, Random Structures and Algorithms 6 (1995) 393-405.