Tree packing and approximating k-cuts

Authors:
Joseph (Seffi) Naor;Yuval Rabani
Affiliations:
Computer Science Dept., Technion, Haifa 32000, Israel;Computer Science Dept., Technion, Haifa 32000, Israel
Venue:
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Year:
2001

Approximating k-cuts via network strength

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum cost subpartitions in graphs

Information Processing Letters
Minimum k-way cuts via deterministic greedy tree packing

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Approximating Steiner k-cuts

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Hi-index	0.00