Localized Client-Server Load Balancing without Global Information
暂无分享,去创建一个
Baruch Awerbuch | Mohammad Taghi Hajiaghayi | Frank Thomson Leighton | Robert D. Kleinberg | B. Awerbuch | F. Leighton | M. Hajiaghayi
[1] Amos Fiat,et al. On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.
[2] Naveen Garg,et al. On-line end-to-end congestion control , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[3] 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).
[4] Éva Tardos,et al. Fast Approximation Algorithms for Fractional Packing and Covering Problems , 1995, Math. Oper. Res..
[5] Eli Upfal,et al. Constructing a perfect matching is in random NC , 1985, STOC '85.
[6] Mihalis Yannakakis,et al. Linear programming without the matrix , 1993, STOC.
[7] Edith Cohen. Approximate Max-Flow on Small Depth Networks , 1995, SIAM J. Comput..
[8] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[9] Baruch Awerbuch,et al. A simple local-control approximation algorithm for multicommodity flow , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[10] Marcin Bienkowski,et al. A practical algorithm for constructing oblivious routing schemes , 2003, SPAA '03.
[11] Andrew V. Goldberg,et al. A new approach to the maximum flow problem , 1986, STOC '86.
[12] Danny Raz,et al. Global optimization using local information with applications to flow control , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[13] Harald Räcke,et al. Minimizing Congestion in General Networks , 2002, FOCS.
[14] Yossi Azar,et al. Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[15] Noam Nisan,et al. A parallel approximation algorithm for positive linear programming , 1993, STOC.
[16] Satish Rao,et al. A polynomial-time tree decomposition to minimize congestion , 2003, SPAA '03.
[17] Edith Cohen,et al. Optimal oblivious routing in polynomial time , 2004, J. Comput. Syst. Sci..
[18] Adi Rosén,et al. Distributed online call control on general networks , 2005, SODA '05.
[19] Yossi Azar,et al. Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[20] Baruch Awerbuch,et al. Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks , 1994, STOC '94.
[21] Mohammad Taghi Hajiaghayi,et al. Oblivious routing on node-capacitated and directed graphs , 2005, SODA '05.