A better algorithm for an ancient scheduling problem
暂无分享,去创建一个
David R. Karger | Eric Torng | Steven J. Phillips | D. Karger | S. Phillips | E. Torng | David R Karger
[1] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .
[2] György Turán,et al. On the performance of on-line algorithms for partition problems , 1989, Acta Cybern..
[3] Amos Fiat,et al. New algorithms for an ancient scheduling problem , 1992, STOC '92.
[4] Yossi Azar,et al. On-line load balancing , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[5] Gerhard J. Woeginger,et al. An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling , 1993, SIAM J. Comput..
[6] Yuval Rabani,et al. A Better Lower Bound for On-Line Scheduling , 1994, Inf. Process. Lett..