Online Bounded Analysis
From MaRDI portal
Publication:5740182
DOI10.1007/978-3-319-34171-2_10zbMath1475.68463arXiv1602.06708OpenAlexW2282511381MaRDI QIDQ5740182
Asaf Levin, Kim S. Larsen, Leah Epstein, Lene Monrad Favrholdt, Joan. Boyar
Publication date: 25 July 2016
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.06708
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)
Related Items (3)
Online Bounded Analysis ⋮ Weighted online problems with advice ⋮ Weighted Online Problems with Advice
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Competitive analysis of maintaining frequent items of a stream
- Fair versus unrestricted bin packing
- On the relative dominance of paging algorithms
- Competitive snoopy caching
- Online algorithms for a dual version of bin packing
- On competitive on-line paging with lookahead
- A new measure for the study of on-line algorithms
- On the influence of lookahead in competitive paging algorithms
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- Extending the accommodating function
- Competitive paging with locality of reference
- List factoring and relative worst order analysis
- The seat reservation problem
- Separating online scheduling algorithms with the relative worst order ratio
- Tight bounds for bandwidth allocation on two links
- The Accommodating Function: A Generalization of the Competitive Ratio
- The Santa Claus problem
- The relative worst order ratio for online algorithms
- Sleep Management on Multiple Machines for Energy and Flow Time
- Improving the Competitive Ratios of the Seat Reservation Problem
- Bounds for List Schedules on Uniform Processors
- Beyond Competitive Analysis
- Markov Paging
- Bounds for Certain Multiprocessing Anomalies
- Online Bounded Analysis
- On paging with locality of reference
- On-line machine covering
- On-line bin-stretching
This page was built for publication: Online Bounded Analysis
