Faster approximation schemes for fractional multicommodity flow problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Research directions for coevolution of rules and routers
Proceedings of the 2003 international symposium on Physical design
The Quickest Multicommodity Flow Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Throughput-centric routing algorithm design
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Floorplan Evaluation with Timing-Driven Global Wireplanning, Pin Assignment and Buffer/Wire Sizing
ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
An Augmented Lagrangian Algorithm for Large Scale Multicommodity Routing
Computational Optimization and Applications
A fast approximation scheme for fractional covering problems with variable upper bounds
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Solving fractional packing problems in Oast(1/ε) iterations
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
A global stability result for primal-dual congestion control algorithms with routing
ACM SIGCOMM Computer Communication Review
Distributed approximation: a survey
ACM SIGACT News
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Pricing for fairness: distributed resource allocation for multiple objectives
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Maximizing lifetime for data aggregation in wireless sensor networks
Mobile Networks and Applications
Short length Menger's theorem and reliable optical routing
Theoretical Computer Science
A combinatorial, primal-dual approach to semidefinite programs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Distributed network monitoring and multicommodity flows: a primal-dual approach
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Faster approximation schemes for fractional multicommodity flow problems
ACM Transactions on Algorithms (TALG)
Scheduling bulk file transfers with start and end times
Computer Networks: The International Journal of Computer and Telecommunications Networking
Stateless distributed gradient descent for positive linear programs
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A Fast and Simple Algorithm for Computing Market Equilibria
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation
IEEE/ACM Transactions on Networking (TON)
Graph partitioning using single commodity flows
Journal of the ACM (JACM)
Online Primal-Dual Algorithms for Covering and Packing
Mathematics of Operations Research
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Truthful unsplittable flow for large capacity networks
ACM Transactions on Algorithms (TALG)
Stateless near optimal flow control with poly-logarithmic convergence
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Proceedings of the forty-second ACM symposium on Theory of computing
Towards a denial-of-service resilient design of complex IPsec overlays
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
IEEE Transactions on Intelligent Transportation Systems
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
SIAM Journal on Computing
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
Proceedings of the 12th ACM conference on Electronic commerce
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
Proceedings of the forty-third annual ACM symposium on Theory of computing
Linear programming in the semi-streaming model with application to the maximum matching problem
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Heuristic improvements for computing maximum multicommodity flow and minimum multicut
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Online primal-dual algorithms for covering and packing problems
ESA'05 Proceedings of the 13th annual European conference on Algorithms
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Distributed resource allocation in stream processing systems
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Approximation algorithm for directed multicuts
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Faster approximate multicommodity flow using quadratically coupled flows
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Metric inequalities and the Network Loading Problem
Discrete Optimization
Sparse WiFi deployment for vehicular internet access with bounded interconnection gap
IEEE/ACM Transactions on Networking (TON)
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
ACM Transactions on Algorithms (TALG)
Linear programming in the semi-streaming model with application to the maximum matching problem
Information and Computation
Content placement via the exponential potential function method
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |
We describe fully polynomial time approximation schemes for various multicommodity 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 run time of previous algorithms by this factor of k, running in ${{\cal O}^*(\epsilon^{-2}m^2)}$ time. 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 Könemann [Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, IEEE, New York, 1998, pp. 300--309]. They are simple, deterministic, and for the versions without costs, they are strongly polynomial. The approximation guarantees are obtained by comparison with dual feasible solutions found by our algorithm.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.