Minimum K-way cuts via deterministic greedy tree

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 159-165

  Thorup, Mikkel ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

K way cuts; Tree packing

Indexed keywords

COMPUTATIONAL GEOMETRY; GRAPH THEORY;

DETERMINISTIC ALGORITHMS; GREEDY TREES; K-WAY CUTS; MINIMAL SPANNING TREES; RANDOMIZED ALGORITHMS; RUNNING TIMES; SPANNING TREES; TREE PACKING;

TREES (MATHEMATICS);

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

References (12)

1. O. Goldschmidt and D. S. Hochbaum. A polynomial algorithm for the k-cut problem for fixed k. Math. Oper. Res., 19(1):24-37, 1994. Announced at FOCS'88.
2. J. Holm, K. Lichtenberg, and M. Thorup. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity. J. ACM, 48(4):723-760, 2001. Announced at STOC'98.
3. Y. Kamidoi, N. Yoshida, and H. Nagamochi. A deterministic algorithm for finding all minimum k-way cuts. SIAM J. Computing, 36(5):1329-1341, 2006.
4. D. R. Karger. Minimum cuts in near-linear time. J. ACM, 47(l):46-76, 2000.
5. D. R. Karger and G. Stein. A new approach to the minimum cut problem. J. ACM, 43(4), 1996.
6. H. Nagamochi, S. Katayama, and T. Ibaraki. Faster algorithm for computing minimum 5-way and 6-way cuts. J. Combinatorial Optimization, 4:151-169, 2000.
7. J. Naor and Y. Rabani. Tree packing and approximating k-cuts. In Proc. 12th SODA, pages 26-27, 2001.
8. C. S. J. A. Nash-Williams. Edge disjoint spanning trees of finite graphs. J. London Math. Soc., 36(144):445-450, 1961.
9. S. A. Plotkin, D. B. Shmoys, and É., Tardos. Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res., 20:257-301, 1995.
10. M. Thorup. Fully-dynamic min-cut. Combinatorial, 27(1):91-127, 2007. Announced at STOC'01
11. W. T. Tutte. On the problem of decomposing a graph into n connected factors. J. London Math. Soc., 36:221-230, 1961.
12. N. Young. Randomized rounding without solving the;liner program proc. The SODA pages 170-178 1995