An improved approximation algorithm for requirement cut
- 25 February 2010
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 38 (4) , 322-325
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size2009
- Approximation Algorithms for Requirement Cut on GraphsAlgorithmica, 2008
- The multi-multiway cut problemTheoretical Computer Science, 2007
- The Steiner k-Cut ProblemSIAM Journal on Discrete Mathematics, 2006
- A tight bound on approximating arbitrary metrics by tree metricsJournal of Computer and System Sciences, 2004
- Approximation Algorithms for Steiner and Directed MulticutsJournal of Algorithms, 1997
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applicationsCombinatorica, 1995
- Finding k Cuts within Twice the OptimalSIAM Journal on Computing, 1995
- The Complexity of Multiterminal CutsSIAM Journal on Computing, 1994