Advertisement

Abstract

We propose the Min-max multiway cut problem, a variant of the traditional Multiway cut problem, but with the goal of minimizing the maximum capacity (rather than the sum or average capacity) leaving a part of the partition. The problem is motivated by data partitioning in Peer-to-Peer networks. The min-max objective function forces the solution not to overload any given terminal, and hence may lead to better solution quality.

We prove that the Min-max multiway cut is NP-hard even on trees, or with only a constant number of terminals. Our main result is an O(log3 n)-approximation algorithm for general graphs, and an O(log2 n)-approximation for graphs excluding any fixed graph as a minor (e.g., planar graphs). We also give a (2+ε)-approximation algorithm for the special case of graphs with bounded treewidth.

Keywords

Approximation Algorithm Polynomial Time Planar Graph Maximum Capacity Approximation Guarantee 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Calinescu, G., Karloff, H., Rabani, Y.: An improved approximation algorithm for multiway cut. In: STOC (1998)Google Scholar
  2. 2.
    Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM Journal on Computing 23(4), 864–894 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Feige, U., Krauthgamer, R.: A polylogarithmic approximation of the minimum bisection. SIAM Journal on Computing 31(4), 1090–1118 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some Simplified NP-Complete Graph Problems. Theoretical Computer Science 1, 237–267 (1976)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman and Company, New York (1979)zbMATHGoogle Scholar
  6. 6.
    Karger, D.R., Klein, P., Stein, C., Thorup, M., Young, N.E.: Rounding algorithms for a geometric embedding of minimum multiway cut. In: STOC (1999)Google Scholar
  7. 7.
    Kleinberg, J., Tardos, E.: Algorithms Design. Addison-Wesley, Reading (to appear)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Zoya Svitkina
    • 1
  • Éva Tardos
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthacaUSA

Personalised recommendations