Approximating fractional multicommodity flow independent of the number of commodities
暂无分享,去创建一个
[1] Luigi Fratta,et al. The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.
[2] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[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] Farhad Shahrokhi,et al. The maximum concurrent flow problem , 1990, JACM.
[5] Clifford Stein,et al. Implementation of a Combinatorial Multicommodity Flow Algorithm , 1991, Network Flows And Matching.
[6] Mihalis Yannakakis,et al. Approximate max-flow min-(multi)cut theorems and their applications , 1993, SIAM J. Comput..
[7] Leonid Khachiyan,et al. Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints , 1994, SIAM J. Optim..
[8] 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..
[9] Neal E. Young,et al. Randomized rounding without solving the linear program , 1995, SODA '95.
[10] David R. Karger,et al. Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows , 1995, STOC '95.
[11] Nathan Linial,et al. The geometry of graphs and some of its algorithmic applications , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[12] Fillia Makedon,et al. Fast Approximation Algorithms for Multicommodity Flow Problems , 1995, J. Comput. Syst. Sci..
[13] Tomasz Radzik. Fast deterministic approximation for the multicommodity flow problem , 1995, SODA '95.
[14] Éva Tardos,et al. Fast Approximation Algorithms for Fractional Packing and Covering Problems , 1995, Math. Oper. Res..
[15] Leonid Khachiyan,et al. Approximate minimum-cost multicommodity flows in $$\tilde O$$ (ɛ−2KNM) timetime , 1996, Math. Program..
[16] David B. Shmoys,et al. Cut problems and their application to divide-and-conquer , 1996 .
[17] Leonid Khachiyan,et al. Coordination Complexity of Parallel Price-Directive Decomposition , 1996, Math. Oper. Res..
[18] D. Bienstock. Experiments with a Network Design Algorithm Using -approximate Linear Programs , 1998 .
[19] Andrew V. Goldberg,et al. An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow , 1998, IPCO.
[20] Jochen Könemann,et al. Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[21] Yuval Rabani,et al. An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm , 1998, SIAM J. Comput..
[22] Frank Thomson Leighton,et al. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.
[23] Andrew B. Kahng,et al. Provably good global buffering using an available buffer block plan , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).
[24] Christoph Albrecht,et al. Provably good global routing by a new approximation algorithm for multicommodity flow , 2000, ISPD '00.