A simple local-control approximation algorithm for multicommodity flow
暂无分享,去创建一个
[1] Fillia Makedon,et al. Fast approximation algorithms for multicommodity flow problems , 1991, STOC '91.
[2] 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.
[3] Pravin M. Vaidya,et al. Speeding-up linear programming using fast matrix multiplication , 1989, 30th Annual Symposium on Foundations of Computer Science.
[4] J. Dennis,et al. Distributed Solution of Network Programming Problems , 1964 .
[5] Nir Shavit,et al. Polynomial end-to-end communication , 1989, 30th Annual Symposium on Foundations of Computer Science.
[6] A. V. Karzanov,et al. Determining the maximal flow in a network by the method of preflows , 1974 .
[7] Baruch Awerbuch,et al. Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks , 1994, STOC '94.
[8] Andrew V. Goldberg,et al. Solving minimum-cost flow problems by successive approximation , 1987, STOC.
[9] Andrew V. Goldberg,et al. Finding Minimum-Cost Circulations by Successive Approximation , 1990, Math. Oper. Res..
[10] Bruce M. Maggs,et al. Approximate load balancing on dynamic and asynchronous networks , 1993, STOC.
[11] R. Ravi,et al. Approximation through multicommodity flow , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.