A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Finding minimum-cost circulations by successive approximation
Mathematics of Operations Research
Finding minimum-cost flows by double scaling
Mathematical Programming: Series A and B
A faster strongly polynomial minimum cost flow algorithm
Operations Research
Implementing an efficient minimum capacity cut algorithm
Mathematical Programming: Series A and B
An efficient implementation of a scaling minimum-cost flow algorithm
Journal of Algorithms
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Experimental study of minimum cut algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for Single-Source Unsplittable Flow
SIAM Journal on Computing
Approximating the single source unsplittable min-cost flow problem
FOCS '00 Proceedings of the 41st 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
Convex combinations of single source unsplittable flows
ESA'07 Proceedings of the 15th annual European conference on Algorithms
| Hi-index | 0.00 |
In the single-source unsplittable flow problem, commodities must be routed simultaneously from a common source vertex to certain sinks in a given graph with edge capacities. The demand of each commodity must be routed along a single path so that the total flow through any edge is at most, its capacity. This problem was introduced by Kleinberg [1996a] and generalizes several NP-complete problems. A cost value per unit of flow may also be defined for every edge. In this paper, we implement the 2-approximation algorithm of Dinitz et al. [1999] for congestion, which is the best known, and the (3, 1)-approximation algorithm of Skutella [2002] for congestion and cost, which is the best known bicriteria approximation. We experimentally study the quality of approximation achieved by the algorithms and the effect of heuristics on their performance. We also compare these algorithms against the previous best ones by Kolliopoulos and Stein [1999].