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]
No references recorded for this publication.
No citations of this publication recorded.