A logarithmic approximation for unsplittable flow on line graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Maximum Bipartite Flow in Networks with Adaptive Channel Width
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Resource allocation with time intervals
Theoretical Computer Science
Truthful mechanisms for exhibitions
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Approximation algorithms for non-single-minded profit-maximization problems with limited supply
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Maximum bipartite flow in networks with adaptive channel width
Theoretical Computer Science
Submodular function maximization via the multilinear relaxation and contention resolution schemes
Proceedings of the forty-third annual ACM symposium on Theory of computing
Scheduling resources for throughput maximization
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Pricing on paths: a PTAS for the highway problem
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Distributed algorithms for scheduling on line and tree networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Constant integrality gap LP formulations of unsplittable flow on a path
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
A constant factor approximation algorithm for the storage allocation problem: extended abstract
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Scheduling jobs with multiple non-uniform tasks
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
Hi-index | 0.00 |
We present approximation algorithms for the unsplittable flow problem (UFP) in undirected graphs. As is standard in this line of research, we assume that the maximum demand is at most the minimum capacity. We focus on the non-uniform capacity case in which the edge capacities can vary arbitrarily over the graph. Our results are: We obtain an $O({\Delta}\alpha^{-1} \log^2 n)$ approximation ratio for UFP, where n is the number of vertices, ${\Delta}$ is the maximum degree, and $\alpha$ is the expansion of the graph. Furthermore, if we specialize to the case where all edges have the same capacity, our algorithm gives an $O({\Delta} \alpha^{-1} \log n)$ approximation. For certain strong constant-degree expanders considered by Frieze [17] we obtain an $O(\sqrt{\log n})$ approximation for the uniform capacity case. For UFP on the line and the ring, we give the first constant-factor approximation algorithms. All of the above results improve if the maximum demand is bounded away from the minimum capacity. The above results either improve upon or are incomparable with previously known results for these problems. The main technique used for these results is randomized rounding followed by greedy alteration, and is inspired by the use of this idea in recent work.