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] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[2] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[3] Pravin M. Vaidya,et al. Fast algorithms for convex quadratic programming and multicommodity flows , 1986, STOC '86.
[4] Andrew V. Goldberg,et al. Solving minimum-cost flow problems by successive approximation , 1987, STOC.
[5] 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.
[6] James B. Orlin,et al. A faster strongly polynomial minimum cost flow algorithm , 1993, STOC '88.
[7] Robert E. Tarjan,et al. Faster Scaling Algorithms for Network Problems , 1989, SIAM J. Comput..
[8] V. Rich. Personal communication , 1989, Nature.
[9] Pravin M. Vaidya,et al. Speeding-up linear programming using fast matrix multiplication , 1989, 30th Annual Symposium on Foundations of Computer Science.
[10] Andrew V. Goldberg,et al. Finding Minimum-Cost Circulations by Successive Approximation , 1990, Math. Oper. Res..
[11] R. Ravi,et al. Approximation through multicommodity flow , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[12] Fillia Makedon,et al. Approximating the minimum net expansion: Near optimal solutions to circuit partitioning problems , 1990, WG.
[13] Farhad Shahrokhi,et al. The maximum concurrent flow problem , 1990, JACM.
[14] Philip N. Klein,et al. Leighton-Rao might be practical: faster approximation algorithms for concurrent flow with uniform capacities , 1990, STOC '90.
[15] Spyros Tragoudas. VLSI partitioning approximation algorithms based on multicommodity flow and other techniques , 1991 .
[16] R. Ravi,et al. Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion , 1991, ICALP.
[17] Andrew V. Goldberg,et al. Finding minimum-cost flows by double scaling , 2015, Math. Program..
[18] Clifford Stein,et al. Approximation algorithms for multicommodity flow and shop scheduling problems , 1992 .
[19] Andrew V. Goldberg. A Natural Randomization Strategy for Multicommodity Flow and Related Algorithms , 1992, Inf. Process. Lett..