Author:
Chekuri Chandra,Khanna Sanjeev
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Aggarwal, C., Orlin, J.: On Multi-route Maximum Flows in Networks. Networks 39, 43–52 (2002)
2. Bagchi, A., Chaudhary, A., Kolman, P.: Short length Menger’s theorem and reliable optical networking. Theoretical Computer Science 339, 315–332 (2005)
3. Bagchi, A., Chaudhary, A., Kolman, P., Sgall, J.: A simple combinatorial proof for the duality of multiroute flows and cuts. TR 2004-662, Charles Univ. (2004)
4. Bar-Yehuda, R., Geiger, D., Naor, J., Roth, R.M.: Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference. SIAM J. Comput. 27(4), 942–959 (1998)
5. Brightwell, G., Oriolo, G., Shepherd, F.B.: Some strategies for reserving resilient capacity. SIAM J. on Discrete Math. 14(4), 524–539 (2001)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献