Fast Approximation Algorithms for Multicommodity Flow Problems
暂无分享,去创建一个
Fillia Makedon | Spyros Tragoudas | Éva Tardos | Frank Thomson Leighton | Serge A. Plotkin | Clifford Stein | F. Leighton | C. Stein | F. Makedon | É. Tardos | S. Tragoudas
[1] Pravin M. Vaidya,et al. Fast algorithms for convex quadratic programming and multicommodity flows , 1986, STOC '86.
[2] Andrew V. Goldberg,et al. Solving minimum-cost flow problems by successive approximation , 1987, STOC.
[3] Frank Thomson Leighton,et al. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[4] Robert E. Tarjan,et al. Faster Scaling Algorithms for Network Problems , 1989, SIAM J. Comput..
[5] V. Rich. Personal communication , 1989, Nature.
[6] Pravin M. Vaidya,et al. Speeding-up linear programming using fast matrix multiplication , 1989, 30th Annual Symposium on Foundations of Computer Science.
[7] R. Ravi,et al. Approximation through multicommodity flow , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[8] Fillia Makedon,et al. Approximating the minimum net expansion: Near optimal solutions to circuit partitioning problems , 1990, WG.
[9] Farhad Shahrokhi,et al. The maximum concurrent flow problem , 1990, JACM.
[10] Spyros Tragoudas. VLSI partitioning approximation algorithms based on multicommodity flow and other techniques , 1991 .
[11] Andrew V. Goldberg,et al. Finding minimum-cost flows by double scaling , 2015, Math. Program..
[12] Clifford Stein,et al. Approximation algorithms for multicommodity flow and shop scheduling problems , 1992 .
[13] Andrew V. Goldberg. A Natural Randomization Strategy for Multicommodity Flow and Related Algorithms , 1992, Inf. Process. Lett..
[14] Leonid Khachiyan,et al. Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints , 1994, SIAM J. Optim..
[15] Philip N. Klein,et al. Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts , 1994, SIAM J. Comput..