On the disjoint paths problem

Authors:
ThíNh Nguyen
Affiliations:
Center for Applied Mathematics, Cornell University, 657 Rhodes Hall, NY 14853, USA
Venue:
Operations Research Letters
Year:
2007

Citing 7
Cited 3

On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints

Journal of Computer and System Sciences
Edge disjoint paths revisited

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Multicommodity Flow and Circuit Switching

HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 7 - Volume 7
Approximation algorithms for disjoint paths problems

Approximation algorithms for disjoint paths problems
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

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

Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees

Approximation and Online Algorithms
Finding multiple induced disjoint paths in general graphs

Information Processing Letters
The maximum integer multiterminal flow problem in directed graphs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using flow and matching algorithms to solve the problem of finding disjoint paths through a given node, and with a technique of Chekuri and Khanna, we give an O(n) approximation for the edge-disjoint paths problem in undirected graphs, directed acyclic graphs and directed graphs with edge capacity at least 2.