Approximation algorithms for minimum K-cut

Algorithmica (New York)

Volumn 27, Issue 2, 2000, Pages 198-207

  Guttmann Beck, N ^a   Hassin, R ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximation algorithms; Minimum cuts

Indexed keywords

EID: 1242331527     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004530010013     Document Type: Article

References (4)

1. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, CA, 1979.
2. O. Goldschmidt and D. S. Hochbaum, A polynomial algorithm for the k-cut problem for fixed k, Mathematics of Operations Research, 19 (1994), 24-37.
3. H. Saran and V. Vazirani, Finding k cuts within twice the optimal, SIAM Journal on Computing, 24 (1995), 101-108.
4. T. Tokuyama and J. Nakano, Geometric algorithms for the minimum cost assignment problem, Random Structures and Algorithms, 6 (1995), 393-405.