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

@inproceedings{Kleinberg1995ApproximationsFT,
  title={Approximations for the disjoint paths problem in high-diameter planar networks},
  author={Jon M. Kleinberg and {\'E}va Tardos},
  booktitle={STOC},
  year={1995}
}
We consider the problem of connecting distinguished terminal pairs in a graph via edgedisjoint paths. This is a classical NP-complete problem for which no general approximation techniques are known; it has recently been brought into focus in papers discussing applications to admission control in high-speed networks and to routing in all-optical networks. In this paper we provide O(logn)-approximation algorithms for two natural optimization versions of this problem for the class of nearly… CONTINUE READING