neal young / Young91Competitive
-
Technical Report, Computer Science Department, Princeton University CS-TR-348-91(1991)
The thesis was about on-line algorithms. The main results
were published in papers described above. The unpublished
results were mainly exploring the role of linear-programming
duality in on-line algorithms, including a method for deriving
a potential-function analysis from a linear-programming
duality analysis, and studies of some on-line matching
algorithms. There were also some minor results analyzing
paging strategies with lookahead.
© Copyrights are reserved by the publishers.
Download for personal and limited academic use only.