Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Ken-ichi Kawarabayashi, Yusuke Kobayashi
Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two
STOC, 2011.

STOC 2011
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-2011-KawarabayashiK,
	author        = "Ken-ichi Kawarabayashi and Yusuke Kobayashi",
	booktitle     = "{Proceedings of the 43rd Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/1993636.1993648",
	isbn          = "978-1-4503-0691-1",
	pages         = "81--88",
	publisher     = "{ACM}",
	title         = "{Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two}",
	year          = 2011,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.