Abstract
We study budgeted variants of classical cut problems: the Multiway Cut problem, the Multicut problem, and the k-Cut problem, and provide approximation algorithms for these problems. Specifically, for the budgeted multiway cut and the k-cut problems we provide constant factor approximation algorithms. We show that the budgeted multicut problem is at least as hard to approximate as the sparsest cut problem, and we provide a bi-criteria approximation algorithm for it.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arora, S., Rao, S., Vazirani, U.: Expander flows, geometric embeddings, and graph partitionings. In: Proc. of STOC 2004, pp. 222–231 (2004)
Arora, S., Lee, J.R., Naor, A.: Euclidean distortion and the sparsest cut. In: Proc. of STOC 2005, pp. 553–562 (2005)
Aura, T., Bishop, M., Sniegowski, D.: Analyzing single-server network inhibition. In: Proc. of CSFW 2000, pp. 108–117 (2000)
Călinescu, G., Karloff, H., Rabani, Y.: An Improved Approximation Algorithm for Multiway Cut. JCSS 60(3), 564–574 (2000)
Chawla, S., Gupta, A., Räcke, H.: Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. In: Proc. of SODA 2005, pp. 102–111 (2005)
Dahlhaus, E., Johnson, D., Papadimitriou, C., Seymour, P., Yannakakis, M.: The Complexity of Multiterminal Cuts. SIAM J. on Computing 23, 864–894 (1994); Preliminary version appeared in Proc. of the 24th ACM Symposium on Theory of Computing, pp. 241–251 (1992)
Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18, 3–20 (1997)
Gomory, R., Hu, T.: Multiterminal network flows. J. of SIAM 9, 551–570 (1961)
Harrelson, C., Hidrum, K., Rao, S.: A polynomial time tree decomposition to minimize congestion. In: Proc. of SPAA 2003, pp. 34–43 (2003)
Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. J. of the ACM 22, 463–468 (1975)
Karger, D., Klein, P., Stein, C., Thorup, M., Young, N.: Rounding algorithms for a geometric embedding of minimum multiway cut. In: STOC 1999, pp. 668–678 (1999)
Khuller, S., Moss, A., Naor, J.: The Budgeted Maximum Coverage Problem. Information Processing Letters 70(1), 39–45 (1999)
Räcke, H.: Minimizing congestion in general networks. In: FOCS 2002, pp. 43–52 (2002)
Saran, H., Vazirani, V.V.: Finding k-cuts within twice the optimal. SIAM J. on Comp. 24, 101–108 (1995)
Sviridenko, M.: A note on maximizing a submodular set function subject to knapsack constraint. Operations Research Letters 32, 41–43 (2004)
Vohra, R.V., Hall, N.G.: A probabilistic analysis of the maximal covering location problem. Discrete Applied Mathematics 43(2), 175–183 (1993)
Wolsey, L.: Maximizing real-valued submodular functions: primal and dual heuristics for location problems. Mathematics of Operations Research 7, 410–425 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Engelberg, R., Könemann, J., Leonardi, S., Naor, J.(. (2006). Cut Problems in Graphs with a Budget Constraint. In: Correa, J.R., Hevia, A., Kiwi, M. (eds) LATIN 2006: Theoretical Informatics. LATIN 2006. Lecture Notes in Computer Science, vol 3887. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11682462_41
Download citation
DOI: https://doi.org/10.1007/11682462_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32755-4
Online ISBN: 978-3-540-32756-1
eBook Packages: Computer ScienceComputer Science (R0)