Amortized efficiency of list update and paging rules
Communications of the ACM
A simple on-line bin-packing algorithm
Journal of the ACM (JACM)
Best-fit bin-packing with random order
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On the online bin packing problem
Journal of the ACM (JACM)
The Accommodating Function: A Generalization of the Competitive Ratio
SIAM Journal on Computing
The competitive ratio for on-line dual bin packing with restricted input sequences
Nordic Journal of Computing
The maximum resource bin packing problem
Theoretical Computer Science
The relative worst-order ratio applied to paging
Journal of Computer and System Sciences
The relative worst order ratio applied to seat reservation
ACM Transactions on Algorithms (TALG)
Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
On the relative dominance of paging algorithms
Theoretical Computer Science
A Comparison of Performance Measures for Online Algorithms
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Comparing First-Fit and Next-Fit for online edge coloring
Theoretical Computer Science
List factoring and relative worst order analysis
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Comparing online algorithms for bin packing problems
Journal of Scheduling
On the absolute approximation ratio for First Fit and related results
Discrete Applied Mathematics
A new variable-sized bin packing problem
Journal of Scheduling
A comparison of performance measures via online search
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Access graphs results for LRU versus FIFO under relative worst order analysis
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Relative interval analysis of paging algorithms on access graphs
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
The frequent items problem in online streaming under various performance measures
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
We define a new measure for the quality of online algorithms, the relative worst order ratio, using ideas from the max/max ratio [Ben-David and Borodin 1994] and from the random order ratio [Kenyon 1996]. The new ratio is used to compare online algorithms directly by taking the ratio of their performances on their respective worst permutations of a worst-case sequence. Two variants of the bin packing problem are considered: the classical bin packing problem, where the goal is to fit all items in as few bins as possible, and the dual bin packing problem, which is the problem of maximizing the number of items packed in a fixed number of bins. Several known algorithms are compared using this new measure, and a new, simple variant of first-fit is proposed for dual bin packing. Many of our results are consistent with those previously obtained with the competitive ratio or the competitive ratio on accommodating sequences, but new separations and easier proofs are found.