Abstract
In this paper, we unify several graph partitioning problems including multicut, multiway cut, and k-cut, into a single problem. The input to a requirement cut problem is an undirected edge-weighted graph G=(V,E), and g groups of vertices X 1, ⋯ ,X g ⊆ V, each with a requirement r i between 0 and |X i |. The goal is to find a minimum cost set of edges whose removal separates each group X i into at least r i disconnected components.
We give an O(log n log (gR)) approximation algorithm for the requirement cut problem, where n is the total number of vertices, g is the number of groups, and R is the maximum requirement. We also show that the integrality gap of a natural LP relaxation for this problem is bounded by O(log n log (gR)). On trees, we obtain an improved guarantee of O(log (gR)). There is a natural Ω (log g) hardness of approximation for the requirement cut problem.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ford, L.R., Fulkerson, J., D.: Maximal flow through a network. Canadian Journal of Math. 8 (1956)
Leighton, T., Rao, S.: An approximate max-flow min-cut theorem for uniform multicommodity flow problems, with applications to approximation algorithms. In: Proc. 29th IEEE Annual Symposium on Foundations of Computer Science, pp. 422–431 (1988)
Klein, P., Rao, S., Agarwal, A., Ravi, R.: An approximate max-flow min-cut relation for multicommodity flow, with applications. In: Proc. 31st IEEE Annnual Symposium on Foundations of Computer Science, pp. 726–737 (1990)
Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi)cut theorems and their applications. In: ACM Symposium on Theory of Computing, pp. 698–707 (1993)
Plotkin, S.A., Tardos, E.: Improved bounds on the max-flow min-cut ratio for multicommodity flows. In: ACM Symposium on Theory of Computing, pp. 691– 697 (1993)
Aumann, Y., Rabani, Y.: An log k approximate min-cut max-flow theorem and approximation algorithm. SIAM J. Comput. 27, 291–301 (1998)
Linial, N., London, E., Rabinovich, Y.: The geometry of graphs and some of its algorithmic applications. FOCS 35, 577–591 (1994)
Karger, D.R., Klein, P.N., Stein, C., Thorup, M., Young, N.E.: Rounding algorithms for a geometric embedding for minimum multiway cut. In: ACM Symposium on Theory of Computing, pp. 668–678 (1999)
Avidor, A., Langberg, M.: The multi-multiway cut problem. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 273–284. Springer, Heidelberg (2004)
Klein, P.N., Plotkin, S.A., Rao, S., Tardos, E.: Approximation algorithms for steiner and directed multicuts. J. Algorithms 22, 241–269 (1997)
Saran, H., Vazirani, V.V.: Finding k cuts within twice the optimal. SIAM J. Comput. 24 (1995)
Chekuri, C., Guha, S., Naor, J.S.: The steiner k-cut problem. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719. Springer, Heidelberg (2003)
Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45, 634–652 (1998)
Konjevod, G., Ravi, R., Srinivasan, A.: Approximation algorithms for the covering steiner problem. Random Struct. Algorithms 20, 465–482 (2002)
Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (2003)
Klein, P.N., Ravi, R.: A nearly best-possible approximation algorithm for nodeweighted steiner trees. J. Algorithms 19, 104–115 (1995)
Arora, S., Rao, S., Vazirani, U.: Expander flows, geometric embeddings and graph partitioning. In: STOC, pp. 222–231 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nagarajan, V., Ravi, R. (2005). Approximation Algorithms for Requirement Cut on Graphs. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds) Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2005 2005. Lecture Notes in Computer Science, vol 3624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11538462_18
Download citation
DOI: https://doi.org/10.1007/11538462_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28239-6
Online ISBN: 978-3-540-31874-3
eBook Packages: Computer ScienceComputer Science (R0)