Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Possibly Related PublicationsThe following publications are possibly variants of this publication: An ::::O::::(log::::n::::)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar GraphsKen-ichi Kawarabayashi, Yusuke Kobayashi. approx 2010: 274-286 [doi]
The following publications are possibly variants of this publication: