Computing minimum multiway cuts in hypergraphs from hypertree packings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6080 LNCS, Issue , 2010, Pages 15-28

  Fukunaga, Takuro ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

HYPEREDGES; HYPERGRAPH; K-CONNECTED; MULTIWAY CUT; POLYNOMIAL-TIME; SPANNING TREE;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING; GRAPH THEORY; TREES (MATHEMATICS);

INTEGER PROGRAMMING;

EID: 77954403559     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13036-6_2     Document Type: Conference Paper

References (21)

1. Chekuri, C., Korula, N.: Personal Communication (2010)
2. Frank, A., Király, T., Kriesell, M.: On decomposing a hypergraph into k connected sub-hypergraphs. Discrete Applied Mathematics 131(2), 373-383 (2003)
3. Garg, N., Vazirani, V.V., Yannakakis, M.: Multiway cuts in node weighted graphs. Journal of Algorithms 50, 49-61 (2004)
4. Gasieniec, L., Jansson, J., Lingas, A., Óstlin, A.: On the complexity of constructing evolutionary trees. Journal of Combinatorial Optimization 3, 183-197 (1999)
5. Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum flow problem. Journal of the ACM 35, 921-940 (1988)
6. Goldschmidt, O., Hochbaum, D.: A polynomial algorithm for the k-cut problem for fixed k. Mathematics of Operations Research 19, 24-37 (1994)
7. Kamidoi, Y., Yoshida, N., Nagamochi, H.: A deterministic algorithm for finding all minimum k-way cuts. SIAM Journal on Computing 36, 1329-1341 (2006)
8. Karger, D.R., Stein, C.: A new approach to the minimum cut problem. Journal of the ACM 43, 601-640 (1996)
9. Klimmek, R.,Wagner, F.: A simple hypergraph min cut algorithm. Internal Report B 96-02, Bericht FU Berlin Fachbereich Mathematik und Informatik (1995)
10. Lawler, E.L.: Cutsets and partitions of hypergraphs. Networks 3, 275-285 (1973)
11. Lorea, M.: Hypergraphes et matroides. Cahiers Centre Etudes Rech. Oper. 17, 289-291 (1975)
12. Lovász, L.: A generalization of König's theorem. Acta.Math. Acad. Sci. Hungar. 21, 443-446 (1970)
13. Mak, W.-K., Wong, D.F.: A fast hypergraph min-cut algorithm for circuit partitioning. Integ. VLSI J. 30, 1-11 (2000)
14. Nagamochi, H.: Algorithms for the minimum partitioning problems in graphs. IEICE Transactions on Information and Systems J86-D-1, 53-68 (2003)
15. Okumoto, K., Fukunaga, T., Nagamochi, H.: Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 55-64. Springer, Heidelberg (2009)
16. Stoer, M., Wagner, F.: A simple min-cut algorithm. J. the ACM 44, 585-591 (1997)
17. Thorup, M.: Fully-dynamic min-cut. Combinatorica 27, 91-127 (2007)
18. Thorup, M.: Minimum k-way cuts via deterministic greedy tree packing. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 159- 166 (2008)
19. Xiao, M.: Finding minimum 3-way cuts in hypergraphs. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 270-281. Springer, Heidelberg (2008)
20. Xiao, M.: An improved divide-and-conquer algorithm for finding all minimum kway cuts. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 208-219. Springer, Heidelberg (2008)
21. Zhao, L., Nagamochi, H., Ibaraki, T.: A unified framework for approximating multiway partition problems. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 682-694. Springer, Heidelberg (2001)