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]
@article{KawarabayashiK13,
title = {An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs},
author = {Ken-ichi Kawarabayashi and Yusuke Kobayashi},
year = {2013},
doi = {10.1145/2438645.2438648},
url = {http://doi.acm.org/10.1145/2438645.2438648},
researchr = {https://researchr.org/publication/KawarabayashiK13},
cites = {0},
citedby = {0},
journal = {ACM Transactions on Algorithms},
volume = {9},
number = {2},
pages = {16},
}