BibTeX record conf/stoc/KawarabayashiK11

download as .bib file

@inproceedings{DBLP:conf/stoc/KawarabayashiK11,
  author       = {Ken{-}ichi Kawarabayashi and
                  Yusuke Kobayashi},
  editor       = {Lance Fortnow and
                  Salil P. Vadhan},
  title        = {Breaking o(n\({}^{\mbox{1/2}}\))-approximation algorithms for the
                  edge-disjoint paths problem with congestion two},
  booktitle    = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
                  2011, San Jose, CA, USA, 6-8 June 2011},
  pages        = {81--88},
  publisher    = {{ACM}},
  year         = {2011},
  url          = {https://doi.org/10.1145/1993636.1993648},
  doi          = {10.1145/1993636.1993648},
  timestamp    = {Tue, 06 Nov 2018 11:07:05 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/KawarabayashiK11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.