On-line load balancing made simple: Greedy strikes back
暂无分享,去创建一个
[1] Dietrich Braess,et al. Über ein Paradoxon aus der Verkehrsplanung , 1968, Unternehmensforschung.
[2] Yossi Azar,et al. On-Line Load Balancing , 1994, Theor. Comput. Sci..
[3] Yossi Azar,et al. On-line load balancing of temporary tasks on identical machines , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.
[4] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.
[5] Yossi Azar,et al. The competitiveness of on-line assignments , 1992, SODA '92.
[6] Giorgio Gambosi,et al. On-line algorithms for the channel assignment problem in cellular networks , 2004, Discret. Appl. Math..
[7] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[8] Joseph Naor,et al. On-Line Load Balancing in a Hierarchical Server Topology , 2002, SIAM J. Comput..
[9] Steven J. Phillips,et al. On-Line Load Balancing and Network Flow , 1993, Algorithmica.
[10] Yossi Azar. On-line Load Balancing , 1996, Online Algorithms.
[11] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .
[12] J. D. Murchland,et al. Braess's paradox of traffic flow , 1970 .
[13] Samir Khuller,et al. Greedy strikes back: improved facility location algorithms , 1998, SODA '98.
[14] Susanne Albers,et al. Better bounds for online scheduling , 1997, STOC '97.
[15] Yuan Ma,et al. An Improved Lower Bound for Load Balancing of Tasks with Unknown Duration , 1997, Inf. Process. Lett..
[16] Bala Kalyanasundaram,et al. On-Line Load Balancing of Temporary Tasks , 1997, J. Algorithms.