Nothing Special   »   [go: up one dir, main page]
Skip to main content
SpringerLink
Log in

Greedy splitting algorithms for approximating multiway partition problems

  • Published:
Mathematical Programming Submit manuscript

Abstract.

Given a system (V,T,f,k), where V is a finite set, is a submodular function and k≥2 is an integer, the general multiway partition problem (MPP) asks to find a k-partition ={V1,V2,...,V k } of V that satisfiesfor all i and minimizes f(V1)+f(V2)+···+f(V k ), where is a k-partition of hold. MPP formulation captures a generalization in submodular systems of many NP-hard problems such as k-way cut, multiterminal cut, target split and their generalizations in hypergraphs. This paper presents a simple and unified framework for developing and analyzing approximation algorithms for various MPPs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Benczúr, A.A.: Counterexamples for directed and node capacitated cut-trees. SIAM J. Comput. 24, 505–510 (1995)

    Google Scholar 

  2. Burlet, M., Goldschmidt, O.: A new and improved algorithm for the 3-cut problem. Oper. Res. Lett. 21, 225–227 (1997)

    Article  Google Scholar 

  3. Calinescu, G., Karloff, H., Rabani, Y.: An improved approximation algorithm for multiway cut. J. Comput. System Sci. 60, 564–574 (2000)

    Article  Google Scholar 

  4. Chopra, S., Owen, J.H.: A note on formulations for the A-partition problem on hypergraphs. Discrete Appl. Math. 90, 115–133 (1999)

    Article  Google Scholar 

  5. Cunningham, W.H.: Optimal attack and reinforcement of a network. J. Assoc. Comput. Mach. 32, 549–561 (1985)

    Google Scholar 

  6. Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D, Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comput. 23, 864–894 (1994)

    Google Scholar 

  7. Gomory, R.E., Hu, T.C.: Multi-terminal network flows. J. Soc. Indust. Appl. Math. 9, 551–570 (1961)

    Google Scholar 

  8. Goldschmidt, O., Hochbaum, D.S.: A polynomial algorithm for the k-cut problem for fixed k. Math. Oper. Res. 1,9 24–37 (1994)

    Google Scholar 

  9. Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum flow problem. J. Assoc. Comput. Mach. 35, 921–940 (1988)

    Google Scholar 

  10. Gusfield, D.: Connectivity and edge-disjoint spanning trees. Inform. Process. Lett. 16, 87–89 (1983)

    Article  Google Scholar 

  11. Garg, N., Vazirani, V.V., Yannakakis, M.: Multiway cuts in directed and node weighted graphs (extended abstract). In Proc. ICALP 1994, LNCS 820, 487–498 (1994)

  12. Iwata, S., Fleischer, L.L., Fujishige, S.: A combinatorial strongly polynomial time algorithm for minimizing submodular functions. J. ACM 48, 761–777 (2001)

    Article  Google Scholar 

  13. Kapoor, S.: On minimum 3-cuts and approximating k-cuts using cut trees. In Proc. IPCO 1996, LNCS 1084, 132–146 (1996)

  14. Karger, D.R., Klein, P., Stein, C., Thorup, M., Young, N.E.: Rounding algorithms for a geometric embedding of minimum multiway cut. In Proc. STOC 1999, 668–678 (1999)

    Google Scholar 

  15. Korte, B., Vygen, J. : Combinatorial Optimization. Theory and Algorithms. Springer, Berlin (2000)

  16. Klimmek, R., Wagner, F.: A simple hypergraph min cut algorithm. Technical Report B 96-02, Freie Universität Berlin (1996)

  17. Lawler, E.L.: Cutsets and partitions of hypergraphs. Networks 3, 275–285 (1973)

    Google Scholar 

  18. Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Layout. Wiley, New York (1990)

  19. Lee, C.H., Kim, M., Park, C.I. : An efficient k-way graph partitioning algorithm for task allocation in parallel computing systems. In Proc. IEEE Int. Conf. on Computer-Aided Design 1990, 748–751 (1990)

    Google Scholar 

  20. Matula, D.W.: A linear time 2+ε approximation algorithm for edge connectivity. In Proc. SODA 1993, 500–504 (1993)

    Google Scholar 

  21. Maeda, N., Nagamochi, H., Ibaraki, T.: Approximate algorithms for multiway objective point split problems of graphs (in Japanese). Computing Devices and Algorithms (in Japanese) (Kyoto, 1993). Surikaisekikenkyusho Kokyuroku 833, 98–109 (1993)

  22. Nagamochi, H., Ibaraki, T.: Computing edge connectivity in multigraphs and capacitated graphs. SIAM J. Discrete Math. 5, 54–66 (1992)

    Google Scholar 

  23. Narayanan, H., Roy, S., Patkar, S.: Approximation algorithms for min-k-overlap problems using the principal lattice of partitions approach. J. Algorithms 21, 306–330 (1996)

    Article  Google Scholar 

  24. Pulleyblank, W.R.: Presentation at SIAM Meeting on Optimization, MIT, Boston (1992)

  25. Queyranne, M.: Minimizing symmetric submodular functions. Math. Program. B 82, 3–12 (1995)

    Article  Google Scholar 

  26. Queyranne, M.: On optimum size-constrained set partitions. AUSSOIS 1999, France (1999)

  27. Saran, H., Vazirani, V.V.: Finding k-cuts within twice the optimal. SIAM J. Comput. 24, 101–108 (1995)

    Google Scholar 

  28. Tittmann, P.: Partitions and network reliability. Discrete Appl. Math. 95, 445–453 (1999)

    Article  Google Scholar 

  29. Vazirani, V.V.: Approximation Algorithms. Springer-Verlag, Berlin (2001)

  30. Zhao, L.: Approximation algorithms for partition and design problems in networks. PhD Thesis, Graduate school of Informatics, Kyoto University, Japan (2002)

  31. Zhao, L., Nagamochi, H., Ibaraki, T.: Approximating the minimum k-way cut in a graph via minimum 3-way cuts. J. Comb. Optim. 5, 397–410 (2001)

    Article  Google Scholar 

  32. Zhao, L., Nagamochi, H., Ibaraki, T.: On generalized greedy splitting algorithms for multiway partition problems. Discrete Appl. Math. (to appear). A preliminary version appeared in Proc. ISAAC 2001 (A unified framework for approximating multiway partition problems (extended abstract). LNCS 2223, 682–694) (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Information Science, Faculty of Engineering, Utsunomiya University, Yoto 7-1-2, Utsunomiya, 321-8585, Japan

    Liang Zhao

  2. Dept. Information and Computer Sciences, Toyohashi University of Technology, Toyohashi, Aichi, 441-8580, Japan

    Hiroshi Nagamochi

  3. Dept. Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto, 606-8501, Japan

    Toshihide Ibaraki

Authors
  1. Liang Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hiroshi Nagamochi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Toshihide Ibaraki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Liang Zhao.

Additional information

Mathematics Subject Classification (1991): 20E28, 20G40, 20C20

Acknowledgement This research is partially supported by the Scientific Grant-in-Aid from Ministry of Education, Science, Sports and Culture of Japan. The authors would like to thank the anonymous referees for their valuable comments and suggestions.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhao, L., Nagamochi, H. & Ibaraki, T. Greedy splitting algorithms for approximating multiway partition problems . Math. Program. 102, 167–183 (2005). https://doi.org/10.1007/s10107-004-0510-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-004-0510-2

Keywords

Search

Navigation