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
Recommended Reading
Agarwal A, Charikar M, Makarychev K, Makarychev Y (2005) O(vlog n) approximation algorithms for Min UnCut, Min 2CNF deletion, and directed cut problems. In: Proceedings of the 37th ACM symposium on theory of computing (STOC), Baltimore, pp 573–581
Aggarwal A, Alon N, Charikar M (2007) Improved approximations for directed cut problems. In: Proceedings of the 39th ACM symposium on theory of computing (STOC), San Diego, pp 671–680
Arora S, Satish R, Vazirani U (2004) Expander flows, geometric embeddings, and graph partitionings. In: Proceedings of the 36th ACM symposium on theory of computing (STOC), Chicago, pp 222–231
Chawla S, Krauthgamer R, Kumar R, Rabani Y, Sivakumar D (2005) On the hardness of approximating sparsest cut and multicut. In: Proceedings of the 20th IEEE conference on computational complexity (CCC), San Jose, pp 144–153
Chuzhoy J, Khanna S (2007) Polynomial flow-cut gaps and hardness of directed cut problems. In: Proceedings of the 39th ACM symposium on theory of computing (STOC), San Diego, pp 179–188
Dahlhaus E, Johnson DS, Papadimitriou CH, Seymour PD, Yannakakis M (1994) The complexity of multiterminal cuts. SIAM Comput J 23(4):864–894
Fleischer L (1999) Approximating fractional multicommodity flow independent of the number of commodities. In: Proceedings of the 40th IEEE symposium on foundations of computer science (FOCS), New York, pp 24–31
Ford LR, Fulkerson DR (1956) Maximal flow through a network. Can J Math 8:399–404
Garg N, Könemann J (1998) Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In: Proceedings of the 39th IEEE symposium on foundations of computer science (FOCS), pp 300–309
Garg N, Vazirani VV, Yannakakis M (1996) Approximate max-flow min-(multi)cut theorems and their applications. SIAM Comput J 25(2):235–251
Grigoriadis MD, Khachiyan LG (1996) Coordination complexity of parallel price-directive decomposition. Math Oper Res 21:321–340
Hu TC (1963) Multi-commodity network flows. Oper Res 11(3):344–360
Khot S, Vishnoi N (2005) The unique games conjecture, integrality gap for cut problems and the embeddability of negative-type metrics into l1 In: Proceedings of the 46th IEEE symposium on foundations of computer science (FOCS), pp 53–62
Klein P, Agrawal A, Ravi R, Rao S (1990) Approximation through multicommodity flow. In: Proceedings of the 31st IEEE symposium on foundations of computer science (FOCS), pp 726–737
Linial N, London E, Rabinovich Y (1995) The geometry of graphs and some of its algorithmic applications. Combinatorica 15(2):215–245, Also in Proceedings of 35th FOCS, pp 577–591 (1994)
Shmoys DB (1997) Cut problems and their application to divide-and-conquer. In: Hochbaum DS (ed) Approximation algorithms for NP-hard problems. PWS, Boston, pp 192–235
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Chawla, S. (2016). Multicut. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_245
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_245
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering