Approximating k-cuts via network strength

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 621-622

  Ravi, R ^a   Sinha, Amitabh ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84968764331     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. W. H. Cunningham, Optimal Attack and Reinforcement of a Network, J. ACM 32(3), 1985.
2. J. Naor and Y. Rabani, Tree Packing and Approximating k-Cuts, Proc. 12th A Annual SODA, 2001.
3. H. Sarau and V. V. Vazirani, Finding k-Cuts within Twice the Optimal, SIAM J. Computing, 1995.
4. A. Sinha, Approximating k-cuts via Network Strength: A Java implementation, http://www.androw.cnru.edu/-asinha/kcut/k:cut.html, 2001.