"An O(logn)-Approximation Algorithm for the Disjoint Paths ..."

Ken-ichi Kawarabayashi, Yusuke Kobayashi (2010)

> Home

Details and statistics

DOI: 10.1007/978-3-642-15369-3_21

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/approx/KawarabayashiK10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/KawarabayashiK10
Ken-ichi Kawarabayashi, Yusuke Kobayashi:
An O(logn)-Approximation Algorithm for the Disjoint Paths Problem in Eulerian Planar Graphs and 4-Edge-Connected Planar Graphs. APPROX-RANDOM 2010: 274-286

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.