Author:
Friggstad Zachary,Salavatipour Mohammad R.
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Andrews, M., Chuzhoy, J., Khanna, S., Zhang, L.: Hardness of the undirected edge-disjoint paths problem with congestion. In: Proc. of 46th IEEE FOCS, pp. 226–244 (2005)
2. Andrews, M., Zhang, L.: Hardness of the undirected edge-disjoint paths problem. In: Proc. of 37th ACM STOC, pp. 276–283. ACM Press, New York (2005)
3. Balister, P.: Packing digraphs with directed closed trials. Combin. Probab. Comput. 12, 1–15 (2003)
4. Caprara, A., Panconesi, A., Rizzi, R.: Packing cuts in undirected graphs. J. Algorithms 44, 1–11 (1999)
5. Caprara, A., Panconesi, A., Rizzi, R.: Packing cycles in undirected graphs. J. Algorithms 48, 239–256 (2003)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献