On generalized greedy splitting algorithms for multiway partition problems

Discrete Applied Mathematics

Volumn 143, Issue 1-3, 2004, Pages 130-143

  Zhao, Liang ^a   Nagamochi, Hiroshi ^b   Ibaraki, Toshihide ^c  

^a UTSUNOMIYA UNIVERSITY   (Japan)

^b TOYOHASHI UNIVERSITY OF TECHNOLOGY   (Japan)

^c KYOTO UNIVERSITY   (Japan)

Author keywords

Approximation algorithm; k way cut; Multiterminal cut; Multiway partition problem; Submodular function

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FUNCTION EVALUATION; OPTIMIZATION; POLYNOMIALS; SET THEORY; THEOREM PROVING;

APPROXIMATION ALGORITHM; K-WAY CUT; MULTITERMINAL CUT; MULTIWAY PARTITION PROBLEM; SUBMODULAR FUNCTION;

PROBLEM SOLVING;

EID: 4243108239     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2003.10.007     Document Type: Article

References (22)

1. Burlet M., Goldschmidt O. A new and improved algorithm for the 3-cut problem. Oper. Res. Lett. 21(5):1997;225-227.
2. Cunningham W.H. The optimal multiterminal cut problem. DIMACS Series in Discrete Math. Theorot. Comput. Sci. 5:1991;105-120.
3. Dahlhaus E., Johnson D.S., Papadimitriou C.H., Seymour P.D., Yannakakis M. The complexity of the multiterminal cuts. SIAM J. Comput. 23(4):1994;864-894.
4. N. Garg, V.V. Vazirani, M. Yannakakis, Multiway cuts in directed and node weighted graphs (extended abstract), in: Proceedings of ICALP 1994, Lecture Note in Computer Science, Vol. 820, Springer, Berlin, 1994, pp. 487-498.
5. Goldschmidt O., Hochbaum D.S. A polynomial algorithm for the. k -cut problem for fixed k Math. Oper. Res. 19(4):1994;24-37.
6. S. Kapoor, On minimum 3-cuts and approximating k -cuts using cut trees, in: Proceedings of IPCO 1996, Lecture Note in Computer Science, Vol. 1084, Springer, Berlin, 1996, pp. 132-146.
7. D.R. Karger, P. Klein, C. Stein, M. Thorup, N.E. Young, Rounding algorithms for a geometric embedding of minimum multiway cut, in Proceedings of the STOC, Atlanta, GA, 1999, pp. 668-678.
8. R. Klimmek, F. Wagner, A simple hypergraph min cut algorithm, Technical Report B 96-02, Freie Universität Berlin, 1996.
9. Lawler E.L. Cutsets and partitions of hypergraphs. Networks. 3:1973;275-285.
10. Lengauer T. Combinatorial Algorithms for Integrated Circuit Layout. 1990;Wiley, New York.
11. C.H. Lee, M. Kim, C.I. Park, An efficient k -way graph partitioning algorithm for task allocation in parallel computing systems, in: Proceedings of the IEEE International Conference on Computer-Aided Design, Santa Clara, CA, 1990, pp. 748-751.
12. N. Maeda, H. Nagamochi, T. Ibaraki, Approximate algorithms for multiway objective point split problems of graphs, in computing devices and algorithms. Surikaisekikenkyusho Kokyuroku, 833, (1993) 98-109. (in Japanese).
13. Nagamochi H., Ibaraki T. A fast algorithm for computing minimum 3-way and 4-way cuts. Math. Program. 88(3):2000;507-520.
14. Nagamochi H., Katayama S., Ibaraki T. A faster algorithm for computing minimum 5-way and 6-way cuts in graphs. J. Combin. Optim. 4:2000;35-78.
15. Queyranne M. Minimizing symmetric submodular functions. Math. Program. 82:1998;3-12.
16. M. Queyranne, On optimum size-constrained set partitions, AUSSOIS 1999, France.
17. Saran H., Vazirani V.V. Finding. k -cuts within twice the optimal SIAM J. Comput. 24(1):1995;101-108.
18. S. Stone H. Multiprocessor scheduling with the aid of network flow algorithms. IEEE Trans. Software Engrg. SE-3:1977;85-93.
19. Tittmann P. Partitions and network reliability. Discrete Appl. Math. 95:1999;445-453.
20. L. Zhao, Approximation algorithms for partition and design problems in networks, Ph.D. Thesis, Graduate School of Informatics, Kyoto University, Japan, March 2002.
21. Zhao L., Nagamochi H., Ibaraki T. Approximating the minimum. k -way cut in a graph via minimum 3 -way cuts J. Combin. Optim. 5(4):2001;397-410.
22. L. Zhao, H. Nagamochi, T. Ibaraki, Greedy splitting algorithms for approximating multiway partition problems, accepted for publication on Math. Program., 2004.