Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Discrete Applied Mathematics
Strengthening integrality gaps for capacitated network design and covering 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
New approaches to covering and packing problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A unified approach to approximating resource allocation and scheduling
Journal of the ACM (JACM)
Approximating the Throughput of Multiple Machines in Real-Time Scheduling
SIAM Journal on Computing
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Improved Approximation Algorithms for Resource Allocation
Proceedings of the 9th International IPCO Conference on Integer Programming and 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
A note on the greedy algorithm for the unsplittable flow problem
Information Processing Letters
Journal of Computer and System Sciences
Graph decomposition and a greedy algorithm for edge-disjoint paths
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A quasi-PTAS for unsplittable flow on line graphs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Edge-disjoint paths in Planar graphs with constant congestion
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Improved bounds for the unsplittable flow problem
Journal of Algorithms
Hardness of routing with congestion in directed graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
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
Mathematics of Operations Research
Approximate formulations for 0-1 knapsack sets
Operations Research Letters
Online Ad Assignment with Free Disposal
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
k-edge-connectivity: approximation and LP relaxation
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Submodular function maximization via the multilinear relaxation and contention resolution schemes
Proceedings of the forty-third annual ACM symposium on Theory of computing
Iterative packing for demand and hypergraph matching
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
On column-restricted and priority covering integer programs
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
On k-column sparse packing programs
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
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
A logarithmic approximation for unsplittable flow on line graphs
ACM Transactions on Algorithms (TALG)
Hi-index | 0.00 |
We consider the unsplittable flow problem (UFP) and the closely related column-restricted packing integer programs (CPIPs). In UFP we are given an edge-capacitated graph G = (V ,E ) and k request pairs R 1 , ..., R k , where each R i consists of a source-destination pair (s i ,t i ), a demand d i and a weight w i . The goal is to find a maximum weight subset of requests that can be routed unsplittably in G . Most previous work on UFP has focused on the no-bottleneck case in which the maximum demand of the requests is at most the smallest edge capacity. Inspired by the recent work of Bansal et al . [3] on UFP on a path without the above assumption, we consider UFP on paths as well as trees. We give a simple O (logn ) approximation for UFP on trees when all weights are identical; this yields an O (log2 n ) approximation for the weighted case. These are the first non-trivial approximations for UFP on trees. We develop an LP relaxation for UFP on paths that has an integrality gap of O (log2 n ); previously there was no relaxation with o (n ) gap. We also consider UFP in general graphs and CPIPs without the no-bottleneck assumption and obtain new and useful results.