Approximation algorithms for edge-disjoint paths and unsplittable flow

Authors:
Thomas Erlebach
Affiliations:
Department of Computer Science, University of Leicester, UK
Venue:
Efficient Approximation and Online Algorithms
Year:
2006

Citing 38
Cited 1

Theory of linear and integer programming

Theory of linear and integer programming
Randomized rounding: a technique for provably good algorithms and algorithmic proofs

Combinatorica - Theory of Computing
Existence and Construction of Edge-Disjoint Pathson Expander Graphs

SIAM Journal on Computing
Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
Randomized algorithms

Randomized algorithms
Approximations for the disjoint paths problem in high-diameter planar networks

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Routing a permutation in the hypercube by two sets of edge disjoint paths

Journal of Parallel and Distributed Computing
Online computation and competitive analysis

Online computation and competitive analysis
A partial k-arboretum of graphs with bounded treewidth

Theoretical Computer Science
Optimal Construction of Edge-Disjoint Paths in Random Graphs

SIAM Journal on Computing
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Improved bounds for all optical routing

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

Journal of the ACM (JACM)
On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints

Journal of Computer and System Sciences
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems

Mathematics of Operations Research
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
Universal Routing Strategies for Interconnection Networks

Universal Routing Strategies for Interconnection Networks
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Edge-Disjoint Paths in Expander Graphs

SIAM Journal on Computing
The Maximum Edge-Disjoint Paths Problem in Bidirected Trees

SIAM Journal on Discrete Mathematics
Edge disjoint paths revisited

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 and Complexity Results for Path Problems in Trees of Rings

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Admission Control to Minimize Rejections

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Approximation Algorithms for the Unsplittable Flow Problem

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
On-line Network Routing

Developments from a June 1996 seminar on Online algorithms: the state of the art
New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Disjoint paths in densely embedded graphs

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
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
Clique is hard to approximate within n1-

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Short paths in expander graphs

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Arc-Disjoint Paths in Expander Digraphs

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Approximation algorithms for disjoint paths problems

Approximation algorithms for disjoint paths problems
Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs

Combinatorics, Probability and Computing
Graph decomposition and a greedy algorithm for edge-disjoint paths

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On-line admission control and circuit routing for high performance computing and communication

SFCS '94 Proceedings of the 35th Annual 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

The design space of probing algorithms for network-performance measurement

Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the maximum edge-disjoint paths problem (MEDP) the input consists of a graph and a set of requests (pairs of vertices), and the goal is to connect as many requests as possible along edge-disjoint paths. We give a survey of known results about the complexity and approximability of MEDP and sketch some of the main ideas that have been used to obtain approximation algorithms for the problem. We consider also the generalization of MEDP where the edges of the graph have capacities and each request has a profit and a demand, called the unsplittable flow problem.