Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference14 articles.
1. Finding minimum-cost flows by double scaling;Ahuja,1988
2. Network flow algorithms;Goldberg,1990
3. Finding minimum-cost circulations by successive approximation;Goldberg;Math. Oper. Res.,1990
4. Fast approximation schemes for convex programs with many blocks and coupling constraints;Grigoriadis,1991
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Maximum Concurrent Flow Solutions for Improved Routing in IoT Future Networks;Arabian Journal for Science and Engineering;2022-11-22
2. Multicast Routing and Design of Sparse Connectors;Algorithmics of Large and Complex Networks;2009
3. Optimization via communication networks;2008 42nd Annual Conference on Information Sciences and Systems;2008-03
4. Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems;SIAM Journal on Computing;2007-01
5. Fractional Matching Via Balls-and-Bins;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2006