Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
The maximum concurrent flow problem
Journal of the ACM (JACM)
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
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
Implementing an efficient minimum capacity cut algorithm
Mathematical Programming: Series A and B
Approximations for the disjoint paths problem in high-diameter planar networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
An efficient implementation of a scaling minimum-cost flow algorithm
Journal of Algorithms
Experimental study of minimum cut algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Disjoint paths in densely embedded graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Beyond the flow decomposition barrier
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Improved Approximation Algorithms for Unsplittable Flow Problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
On the Single-Source Unsplittable Flow Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Single-source unsplittable flow
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximation algorithms for disjoint paths problems
Approximation algorithms for disjoint paths problems
Exact and approximation algorithms for network flow and disjoint-path problems
Exact and approximation algorithms for network flow and disjoint-path problems
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Approximation through multicommodity flow
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
In the single-source unsplittable flow problem, we are given a network G, a source vertex s and k commodities with sinks ti and real-valued demands ρi, 1 ≤ i ≤ k. We seek to route the demand ρi of each commodity i along a single s-ti flow path, so that the total flow routed across any edge e is bounded by the edge capacity ce. This NP-hard problem combines the difficulty of bin-packing with routing through an arbitrary graph and has many interesting and important variations. In this paper we initiate the experimental evaluation of approximation algorithms for unsplittable flow problems. We examine the quality of approximation achieved by several algorithms for finding a solution with near-optimal congestion. In the process we analyze theoretically a new algorithm and report on the practical relevance of heuristics based on minimum-cost flow. The experimental results demonstrate practical performance that is better than the theoretical guarantees for all algorithms tested. Moreover modifications to the algorithms to achieve better theoretical results translate to improvements in practice as well.