Online-bounded analysis
From MaRDI portal
Recommendations
Cites work
- A new measure for the study of on-line algorithms
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- Advice complexity for a class of online problems
- Beyond Competitive Analysis
- Bounds for Certain Multiprocessing Anomalies
- Bounds for List Schedules on Uniform Processors
- Competitive analysis of maintaining frequent items of a stream
- Competitive paging with locality of reference
- Competitive snoopy caching
- Extending the accommodating function
- Fair versus unrestricted bin packing
- scientific article; zbMATH DE number 65698 (Why is no real title available?)
- scientific article; zbMATH DE number 871933 (Why is no real title available?)
- Improving the competitive ratios of the seat reservation problem
- List factoring and relative worst order analysis
- Markov Paging
- On competitive on-line paging with lookahead
- On paging with locality of reference
- On the influence of lookahead in competitive paging algorithms
- On the relative dominance of paging algorithms
- On the separation and equivalence of paging strategies
- On-line bin-stretching
- On-line machine covering
- Online algorithms for a dual version of bin packing
- Randomized on-line scheduling on two uniform machines
- Separating online scheduling algorithms with the relative worst order ratio
- Sleep management on multiple machines for energy and flow time
- Speed is as powerful as clairvoyance
- The accommodating function: A generalization of the competitive ratio
- The relative worst order ratio for online algorithms
- The Santa Claus problem
- The seat reservation problem
- Tight bounds for bandwidth allocation on two links
- Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
Cited in
(5)
This page was built for publication: Online-bounded analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1617274)
