Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. Andrews, M., Chuzhoy, J., Khanna, S., Zhang, L.: Hardness of the undirected edge-disjoint paths problem with congestion. In: Proceedings of the 46th IEEE FOCS (2005)
2. Andrews, M., Zhang, L.: Hardness of the undirected congestion minimization problem. In: Proceedings of the 37th ACM STOC (2005)
3. Andrews, M., Zhang, L.: Hardness of the undirected edge-disjoint path problem. In: Proceedings of the 37th ACM STOC (2005)
4. Andrews, M., Zhang, L.: Logarithmic hardness of the directed congestion minimization problem. In: Proceedings of the 38th ACM STOC (2006)
5. Aumann, Y., Rabani, Y.: Improved bounds for all-optical routing. In: Proceedings of the 6th ACM-SIAM SODA, pp. 567–576 (1995)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Flow-cut gaps for integer and fractional multiflows;Journal of Combinatorial Theory, Series B;2013-03
2. Disjoint paths in sparse graphs;Discrete Applied Mathematics;2009-10