Competitive algorithms for on-line problems
暂无分享,去创建一个
Lyle A. McGeoch | Daniel Dominic Sleator | Mark S. Manasse | L. A. McGeoch | M. Manasse | D. Sleator | L. McGeoch
[1] A. Robert Calderbank,et al. Sequencing Problems in Two-Server Systems , 1985, Math. Oper. Res..
[2] E. Coffman,et al. Sequencing two servers on a sphere , 1985 .
[3] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[4] Jon Louis Bentley,et al. Amortized analyses of self-organizing sequential search heuristics , 1985, CACM.
[5] Anna R. Karlin,et al. Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[6] Lyle Andrew Mcgeoch,et al. Algorithms for two graph problems: computing maximum-genus imbeddings and the two-server problem , 1987 .
[7] Allan Borodin,et al. An optimal online algorithm for metrical task systems , 1987, STOC.