An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs

Ken-ichi Kawarabayashi, Yusuke Kobayashi. An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs. ACM Transactions on Algorithms, 9(2):16, 2013. [doi]

Abstract

Abstract is missing.