Funder
Natural Sciences and Engineering Research Council of Canada
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference32 articles.
1. Abraham, I., Bartal, Y., Neiman, O.: Nearly tight low stretch spanning trees. In: FOCS, pp. 781–790 (2008)
2. Alon, N., Karp, R.M., Peleg, D., West, D.: A graph-theoretic game and its application to the k-server problem. SIAM J. Comput. 24(1), 78–100 (1995)
3. Andersen, R., Feige, U.: Interchanging distance and capacity in probabilistic mappings. arXiv preprint arXiv:0907.3631 (2009)
4. Chekuri, C., Khanna, S., Shepherd, F.B.: Edge-disjoint paths in planar graphs with constant congestion. SIAM J. Comput. 39, 281–301 (2009)
5. Chekuri, C., Ene, A.: Poly-logarithmic approximation for maximum node disjoint paths with constant congestion. In: Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, pp. 326–341. SIAM (2013)