An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs

In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in the class of all even-degree planar graphs [19]. This paper answers the question in the affirmative, by providing such an algorithm. The algorithm builds on recent work of Chekuri, Khanna, and Shepherd [7, 8], who considered routing problems in planar graphs where each edge can carry up to two paths.

• Type: Conference
• Year: 2005
• Where: FOCS
• Authors: Jon M. Kleinberg
• Keywords: Even-degree Planar Graphs, FOCS 2005, Planar Graphs, Polylogarithmic Approximation Algorithm, Theoretical Computer Science