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]

Authors

Ken-ichi Kawarabayashi

This author has not been identified. Look up 'Ken-ichi Kawarabayashi' in Google

Yusuke Kobayashi

This author has not been identified. Look up 'Yusuke Kobayashi' in Google