View Document Preview and Link Document Date: 2005-08-11 23:51:43 Open Document File Size: 169,08 KB Share Result on Facebook
City Berlin / / Company Plenum Press / Israel Journal / Diameter Planar Networks / / Currency pence / / / Facility Cornell University / Carnegie Mellon University / / IndustryTerm disjoint paths algorithms / deterministic algorithms / performance computing / good algorithms / approximation algorithm / disjoint paths algorithm / approximate solution / polynomial-time algorithm / c-approximation algorithm / polylogarithmic approximation algorithms / polylogarithmic approximation algorithm / overall algorithm / graph algorithms / polynomialtime algorithm / approximation algorithms / / Organization National Science Foundation / Department of Computer Science / Carnegie Mellon University / Cornell University / / Person Robin Thomas / U. Vazirani / V / Bruce Shepherd / N. Garg / V / Chandra Chekuri / Paul Seymour / Sanjeev Khanna / Xa / W. Thatcher / P.D. Seymour / Neil Robertson / / / Product CCR / / PublishedMedium Theory of Computing / / Technology polynomial-time / polylogarithmic approximation algorithm / graph algorithms / Decision Algorithms / c-approximation algorithm / On-Line Algorithms / overall algorithm / disjoint paths algorithm / CKS algorithm / Primal-dual approximation algorithms / approximation algorithm / polynomial-time algorithm / provably good algorithms / disjoint paths algorithms / well.3 The CKS algorithm / approximation algorithms / ATM / polynomialtime algorithm / polylogarithmic approximation algorithm / Parallel Processing / routing algorithm / polylogarithmic approximation algorithms / circuit-switched / Integrated Circuit / / SocialTag 
An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs Jon Kleinberg ∗ Abstract