History
1
an:70968526
1


Please fill in your query. A complete syntax description you will find on the General Help page.
Breaking $o(n^{1/2})$-approximation algorithms for the edge-disjoint paths problem with congestion two (English)
STOC, 81-88 (2011).
WorldCat.org
PDF XML AMS-TeX TEXT BIBTeX DOI
Valid XHTML 1.0 Transitional Valid CSS!