## Approximation Algorithms for Disjoint Paths Problems (1996)

Citations: | 140 - 0 self |

### BibTeX

@MISC{Kleinberg96approximationalgorithms,

author = {Jon Michael Kleinberg},

title = {Approximation Algorithms for Disjoint Paths Problems},

year = {1996}

}

### Years of Citing Articles

### OpenURL

### Abstract

The construction of disjoint paths in a network is a basic issue in combinatorial optimization: given a network, and specified pairs of nodes in it, we are interested in finding disjoint paths between as many of these pairs as possible. This leads to a variety of classical NP-complete problems for which very little is known from the point of view of approximation algorithms. It has recently been brought into focus in work on problems such as VLSI layout and routing in high-speed networks; in these settings, the current lack of understanding of the disjoint paths problem is often an obstacle to the design of practical heuristics.