Funder
Natural Sciences and Engineering Research Council of Canada
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference23 articles.
1. Andrews, M.: Approximation algorithms for the edge-disjoint paths problem via Räcke decompositions. In: 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp. 277–286 (2010)
2. Andrews, M., Chuzhoy, J., Guruswami, V., Khanna, S., Talwar, K., Zhang, L.: Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. Combinatorica 30(5), 485–520 (2010)
3. Chekuri, C., Khanna, S., Shepherd, F.B.: Edge-disjoint paths in planar graphs. In: 45th Annual IEEE Symposium on Foundations of Computer Science, 2004. Proceedings, pp. 71–80 (2004)
4. Chekuri, C., Chuzhoy, J.: Maximum node-disjoint paths with congestion 2. Personal communication (2016)
5. Chekuri, C., Khanna, S., Bruce Shepherd, F.: Edge-disjoint paths in planar graphs with constant congestion. In: STOC ’06: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 757–766. ACM, New York, NY (2006)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献