The maximum concurrent flow problem
Journal of the ACM (JACM)
Fast approximation algorithms for multicommodity flow problems
Selected papers of the 23rd annual ACM symposium on Theory of computing
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Cut problems and their application to divide-and-conquer
Approximation algorithms for NP-hard problems
Coordination complexity of parallel price-directive decomposition
Mathematics of Operations Research
Approximate minimum-cost multicommodity flows in O˜(&egr;-2KNM) time
Mathematical Programming: Series A and B
Randomized rounding without solving the linear program
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
SIAM Journal on Computing
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Provably good global routing by a new approximation algorithm for multicommodity flow
ISPD '00 Proceedings of the 2000 international symposium on Physical design
Provably good global buffering by multi-terminal multicommodity flow approximation
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Provably good global buffering using an available buffer block plan
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Practical Approximation Algorithms for Separable Packing Linear Programs
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Improved approximations for tour and tree covers
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Routing using potentials: a dynamic traffic-aware routing algorithm
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Truthful unsplittable flow for large capacity networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
VPN topology abstraction service using centralized core capacity sharing scheme
ANTS'09 Proceedings of the 3rd international conference on Advanced networks and telecommunication systems
| Hi-index | 0.00 |
We describe fully polynomial time approximation schemes for various multi-commodity flow problems in graphs with m edges and n vertices. We present the first approximation scheme for maximum Multicommodity flow that is independent of the number of commodities k, and our algorithm improves upon the runtime of previous algorithms by this factor of k, running time proportional to the square of m, and inversely proportional to the square of the desired accuracy. For maximum concurrent flow, and minimum cost concurrent flow, we present algorithms that are faster than the current known algorithms when the graph is sparse or the number of commodities k is large, i.e. k m/n. Our algorithms build on the framework proposed by Garg and Konemann. They are simple, deterministic, and for the versions without costs, they are strongly polynomial.Our maximum multicommodity flow algorithm extends to an approximation scheme for the maximum weighted multicommodity flow, which is faster than those implied by previous algorithms by a factor of k(log W) where W is the maximum weight of a commodity.