"Breaking o(n1/2)-approximation algorithms for the edge-disjoint ..."

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

Ken-ichi Kawarabayashi, Yusuke Kobayashi (2011)

> Home

Details and statistics

DOI: 10.1145/1993636.1993648

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/KawarabayashiK11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/KawarabayashiK11
Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Breaking o(n^1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two. STOC 2011: 81-88

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.