Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in ..."

Ken-ichi Kawarabayashi, Yusuke Kobayashi (2013)

> Home

Details and statistics

DOI: 10.1145/2438645.2438648

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/KawarabayashiK13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/KawarabayashiK13
Ken-ichi Kawarabayashi, Yusuke Kobayashi:
An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs. ACM Trans. Algorithms 9(2): 16:1-16:13 (2013)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.