Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Approximation Algorithms for Unsplittable Flow Problems
FOCS '97 Proceedings of the 38th 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
New hardness results for congestion minimization and machine scheduling
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Hardness of the undirected congestion minimization problem
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Minimum-cost single-source 2-splittable flow
Information Processing Letters
Approximation and complexity of k–splittable flows
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |
This work deals with the minimum congestion single-source k-splittable flow problem: given a network and a set of terminal pairs sharing a common source node, the aim is to route concurrently all demands using at most k supporting paths for each commodity and minimizing the congestion on arcs. Dinitz et al. proposed in [Y. Dinitz, N. Garg, M.X. Goemans, On the single-source unsplittable flow problem, Combinatorica 19 (1999) 17-41] the best known constant factor approximated algorithm for the case of k=1, namely the single source unsplittable case. Here we consider an adaptation of such an algorithm to the k-splittable case. Moreover, we propose a heuristic improvement of the first step of this algorithm, that provides experimentally better results without affecting the approximation guarantee of the algorithm.