Skip to main content
Springer Nature Link
Log in

Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings

  • Conference paper
Integer Programming and Combinatorial Optimization (IPCO 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6080))

Abstract

Hypergraph k-cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into k connected components. We present an algorithm for this problem which runs in strongly polynomial-time if both k and the rank of the hypergraph are constants. Our algorithm extends the algorithm due to Thorup (2008) for computing minimum k-cuts of graphs from greedy packings of spanning trees.

This work was partially supported by Grant-in-Aid for Scientific Research from the Ministry of Education, Culture, Sports, Science and Technology of Japan.

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

Access this chapter

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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Chekuri, C., Korula, N.: Personal Communication (2010)

    Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  3. Garg, N., Vazirani, V.V., Yannakakis, M.: Multiway cuts in node weighted graphs. Journal of Algorithms 50, 49–61 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Gasieniec, L., Jansson, J., Lingas, A., Óstlin, A.: On the complexity of constructing evolutionary trees. Journal of Combinatorial Optimization 3, 183–197 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  5. Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum flow problem. Journal of the ACM 35, 921–940 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  6. Goldschmidt, O., Hochbaum, D.: A polynomial algorithm for the k-cut problem for fixed k. Mathematics of Operations Research 19, 24–37 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  8. Karger, D.R., Stein, C.: A new approach to the minimum cut problem. Journal of the ACM 43, 601–640 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  9. Klimmek, R., Wagner, F.: A simple hypergraph min cut algorithm. Internal Report B 96-02, Bericht FU Berlin Fachbereich Mathematik und Informatik (1995)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  11. Lorea, M.: Hypergraphes et matroides. Cahiers Centre Etudes Rech. Oper. 17, 289–291 (1975)

    MATH  MathSciNet  Google Scholar 

  12. Lovász, L.: A generalization of König’s theorem. Acta. Math. Acad. Sci. Hungar. 21, 443–446 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  13. Mak, W.-K., Wong, D.F.: A fast hypergraph min-cut algorithm for circuit partitioning. Integ. VLSI J. 30, 1–11 (2000)

    Article  MATH  Google Scholar 

  14. Nagamochi, H.: Algorithms for the minimum partitioning problems in graphs. IEICE Transactions on Information and Systems J86-D-1, 53–68 (2003)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  16. Stoer, M., Wagner, F.: A simple min-cut algorithm. J. the ACM 44, 585–591 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  17. Thorup, M.: Fully-dynamic min-cut. Combinatorica 27, 91–127 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  20. Xiao, M.: An improved divide-and-conquer algorithm for finding all minimum k-way cuts. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 208–219. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Japan

    Takuro Fukunaga

Authors
  1. Takuro Fukunaga
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics, École Polytechnique Féderale de Lausanne, 1015, Lausanne, Switzerland

    Friedrich Eisenbrand

  2. McGill University, 805 Sherbrooke West, H3A 2K6, Montreal, Quebec, Canada

    F. Bruce Shepherd

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fukunaga, T. (2010). Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings. In: Eisenbrand, F., Shepherd, F.B. (eds) Integer Programming and Combinatorial Optimization. IPCO 2010. Lecture Notes in Computer Science, vol 6080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13036-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13036-6_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13035-9

  • Online ISBN: 978-3-642-13036-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics