Amortized efficiency of list update and paging rules
Communications of the ACM
Competitive algorithms for server problems
Journal of Algorithms
On-line caching as cache size varies
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Coloring interval graphs with First-Fit
Discrete Mathematics
The Accommodating Function: A Generalization of the Competitive Ratio
SIAM Journal on Computing
Resource Augmentation in Load Balancing
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Fair versus Unrestricted Bin Packing
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Speed is as powerful as clairvoyance [scheduling problems]
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Weak Adversaries for the k-Server Problem
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
Journal of Scheduling - Special issue: On-line algorithm part I
| Hi-index | 0.00 |
The applicability of the accommodating function, a relatively new measure for the quality of on-line algorithms, is extended. If a limited amount n of some resource is available, the accommodating function A(驴) is the competitive ratio when input sequences are restricted to those for which the amount 驴n of resources suffices for an optimal off-line algorithm. The accommodating function was originally used only for 驴 驴 1. We focus on 驴