Decision algorithms for unsplittable flow and the half-disjoint paths problem
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Simple on-line algorithms for the maximum disjoint paths problem
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Improved bounds for the unsplittable flow problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Strongly Polynomial Algorithms for the Unsplittable Flow Problem
Proceedings of the 8th 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
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
The all-or-nothing multicommodity flow problem
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Wireless ATM layouts for chain networks
Mobile Networks and Applications
Multicommodity flow, well-linked terminals, and routing problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Hardness of the undirected edge-disjoint paths problem
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
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
New hardness results for congestion minimization and machine scheduling
Journal of the ACM (JACM)
Logarithmic hardness of the undirected edge-disjoint paths problem
Journal of the ACM (JACM)
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
Single source multiroute flows and cuts on uniform capacity networks
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Half integral packing, Erdős-Posá-property and graph minors
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Algorithms (TALG)
A nearly linear time algorithm for the half integral disjoint paths packing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
The maximum edge-disjoint paths problem in complete graphs
Theoretical Computer Science
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
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
Throughput maximization for periodic packet routing on trees and grids
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Edge Disjoint Paths in Moderately Connected Graphs
SIAM Journal on Computing
The disjoint paths problem: algorithm and structure
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Maximum bipartite flow in networks with adaptive channel width
Theoretical Computer Science
Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two
Proceedings of the forty-third annual ACM symposium on Theory of computing
Approximation strategies for routing edge disjoint paths in complete graphs
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Edge disjoint paths in moderately connected graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Approximation algorithms for edge-disjoint paths and unsplittable flow
Efficient Approximation and Online Algorithms
Routing in undirected graphs with constant congestion
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A logarithmic approximation for unsplittable flow on line graphs
ACM Transactions on Algorithms (TALG)
Fast pattern-specific routing for fat tree networks
ACM Transactions on Architecture and Code Optimization (TACO)
| Hi-index | 0.00 |
We present improved approximation algorithms for a family of problems involving edge-disjoint paths and unsplittable flow, and for some related routing problems. The central theme of all our algorithms is the underlying multi-commodity flow relaxation.