Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs
Work
Year: 2010
Type: article
Source: COMBINATORICA
Institutions Alcatel Lucent (Germany), Toyota Technological Institute at Chicago, Carnegie Mellon University, University of Pennsylvania, Microsoft (United States) +1 more
Cites: 36
Cited by: 62
Related to: 10
FWCI: 3.834
Citation percentile (by year/subfield): 92.27
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green