%0 Journal Article %1 journals/talg/KawarabayashiK13 %A ichi Kawarabayashi, Ken %A Kobayashi, Yusuke %D 2013 %J ACM Trans. Algorithms %K dblp %N 2 %P 16:1-16:13 %T An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs. %U http://dblp.uni-trier.de/db/journals/talg/talg9.html#KawarabayashiK13 %V 9

@article{journals/talg/KawarabayashiK13, added-at = {2018-11-06T00:00:00.000+0100}, author = {ichi Kawarabayashi, Ken and Kobayashi, Yusuke}, biburl = {https://www.bibsonomy.org/bibtex/22fc770e98a1df9031a4584dfecb89ae4/dblp}, ee = {https://doi.org/10.1145/2438645.2438648}, interhash = {f87ba0bb26e026d0b005acee151709c8}, intrahash = {2fc770e98a1df9031a4584dfecb89ae4}, journal = {ACM Trans. Algorithms}, keywords = {dblp}, number = 2, pages = {16:1-16:13}, timestamp = {2018-11-07T12:13:49.000+0100}, title = {An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs.}, url = {http://dblp.uni-trier.de/db/journals/talg/talg9.html#KawarabayashiK13}, volume = 9, year = 2013 }