Cited By
View all- Shi YZhang FLiu Z(2017)Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed GraphsTheory and Applications of Models of Computation10.1007/978-3-319-55911-7_41(571-585)Online publication date: 21-Mar-2017
- Andrews M(2010)Approximation Algorithms for the Edge-Disjoint Paths Problem via Raecke DecompositionsProceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science10.1109/FOCS.2010.33(277-286)Online publication date: 23-Oct-2010
- Andrews MChuzhoy JGuruswami VKhanna STalwar KZhang L(2010)Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphsCombinatorica10.1007/s00493-010-2455-930:5(485-520)Online publication date: 1-Sep-2010
- Show More Cited By