Greedy approximation algorithms for directed multicuts
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Approximating Directed MulticutsCombinatorica, 2005
- Divide-and-conquer approximation algorithms via spreading metricsJournal of the ACM, 2000
- Approximating Fractional Multicommodity Flow Independent of the Number of CommoditiesSIAM Journal on Discrete Mathematics, 2000
- Primal-dual approximation algorithms for integral flow and multicut in treesAlgorithmica, 1997
- Approximation Algorithms for Steiner and Directed MulticutsJournal of Algorithms, 1997
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their ApplicationsSIAM Journal on Computing, 1996
- Packing directed circuits fractionallyCombinatorica, 1995
- Flows in Networks1963