Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference23 articles.
1. Network Flows—Theory, Algorithms, and Applications;Ahuja,1993
2. Hardness of the undirected edge-disjoint paths problem;Andrews,2005
3. Multiway cut and integer flow problems in trees;Billionnet;Proceedings of CTW04, ENDM,2004
4. C. Chekuri, S. Khanna, F.B. Shepherd, An O(n)-approximation and integrality gap for disjoint paths and UFP, Theory of Computing 2 (2006) 137–146.
5. Efficient algorithms for k-terminal cuts on planar graphs;Chen;Algorithmica,2004
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献