SIAM Journal on Discrete Mathematics
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Page replacement for general caching problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A unified approach to approximating resource allocation and scheduling
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Off-line admission control for general scheduling problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Mathematics of Operations Research
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Approximation Algorithms for Resource Allocation
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Algorithms for the Unsplittable Flow Problem
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Approximation algorithms for disjoint paths problems
Approximation algorithms for disjoint paths problems
Hardness of the undirected edge-disjoint paths problem
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Multicommodity demand flow in a tree
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Multicommodity demand flow in a tree and packing integer programs
ACM Transactions on Algorithms (TALG)
A logarithmic approximation for unsplittable flow on line graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
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 Minimization Job Scheduling
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
A quasi-PTAS for profit-maximizing pricing on line graphs
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Resource allocation with time intervals
Theoretical Computer Science
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
Resource allocation for covering time varying demands
ESA'11 Proceedings of the 19th European conference on Algorithms
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
A QPTAS for ε-envy-free profit-maximizing pricing on line graphs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Online capacitated interval coloring
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
A path-decomposition theorem with applications to pricing and covering on trees
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
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
Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem
INFORMS Journal on Computing
A logarithmic approximation for unsplittable flow on line graphs
ACM Transactions on Algorithms (TALG)
Approximation algorithms for the ring loading problem with penalty cost
Information Processing Letters
| Hi-index | 0.00 |
We study the Unsplittable Flow Problem (UFP) on line graphs and cycles, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-polynomial time approximation scheme for UFP on line graphs, thereby ruling out an APX-hardness result, unless NP ⊆ DTIME(2polylog(n)). Our result requires a quasi-polynomial bound on all edge capacities and demands in the input instance. We extend this result to undirected cycle graphs.Earlier results on this problem included a polynomial time (2+ε)-approximation under the assumption that no demand exceeds any edge capacity (the "no-bottleneck assumption") and a super-constant integrality gap if this assumption did not hold. Unlike most earlier work on UFP, our results do not require a no-bottleneck assumption.