Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems 论文
2007SIAM Journal on Computing引用 312
Optimization and Packing ProblemsComplexity and Algorithms in GraphsAdvanced Manufacturing and Logistics Optimization
摘要
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We present new, faster, and much simpler algorithms for these problems.