The maximum concurrent flow problem
Journal of the ACM (JACM)
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
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
Approximate minimum-cost multicommodity flows in O˜(&egr;-2KNM) time
Mathematical Programming: Series A and B
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
SIAM Journal on Computing
Randomized rounding without solving the linear program
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fast deterministic approximation for the multicommodity flow problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Faster approximation algorithms for generalized flow
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
SIAM Journal on Discrete Mathematics
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
Proceedings of the 9th annual international conference on Mobile computing and networking
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
Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels
IEEE/ACM Transactions on Networking (TON)
Fast network re-optimization schemes for MPLS and optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Communication latency aware low power NoC synthesis
Proceedings of the 43rd annual Design Automation Conference
Faster approximation schemes for fractional multicommodity flow problems
ACM Transactions on Algorithms (TALG)
Advancing supercomputer performance through interconnection topology synthesis
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Lifetime maximization for connected target coverage in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation
IEEE/ACM Transactions on Networking (TON)
Fast network re-optimization schemes for MPLS and optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Intra-domain routing convergence with centralized control
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal routing and scheduling for deterministic delay tolerant networks
WONS'09 Proceedings of the Sixth international conference on Wireless On-Demand Network Systems and Services
Pairwise data clustering and applications
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Fast network re-optimization schemes for MPLS and optical networks
IWQoS'03 Proceedings of the 11th international conference on Quality of service
Traffic engineering and routing in IP networks with centralized control
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Proceedings of the forty-second ACM symposium on Theory of computing
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
We present fully polynomial approximation schemes for concurrent multicommodity flow problems that run in time independent of the number of commodities k. We show that by modifying the algorithms by Garg & Könemann [5] and Fleischer [3] we can reduce their running time to a logarithmic dependence on k, and essentially match the running time of [3] for the maximum multicommodity flow problem.