CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Filters
1 research outputs found
Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs
Author
A. Baveja
A. Frank
+20Â more
C. Chekuri
J. HÃ¥stad
J. HÃ¥stad
J. M. Kleinberg
J. M. Kleinberg
Julia Chuzhoy
Kunal Talwar
L. Engebretsen
Lisa Zhang
Matthew Andrews
N. Garg
N. Robertson
P. Erdős
P. Raghavan
R. Raz
S. Fortune
Sanjeev Khanna
V. Guruswami
Venkatesan Guruswami
Y. Aumann
Publication venue
'Springer Science and Business Media LLC'
Publication date
Field of study
Full text link
Crossref