Resource augmented semi-online bounded space bin packing
From MaRDI portal
Publication:967321
DOI10.1016/j.dam.2009.03.015zbMath1209.90336OpenAlexW1993445265MaRDI QIDQ967321
Publication date: 28 April 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.03.015
Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Online algorithms; streaming algorithms (68W27)
Related Items (2)
Semi-on-line bin packing: a short overview and a new lower bound ⋮ Tight bounds for NF-based bounded-space online bin packing algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fundamental restriction on fully dynamic maintenance of bin packing
- Paging with connections: FIFO strikes again
- An improved lower bound for on-line bin packing algorithms
- Repacking helps in bounded space on-line bin-packing
- Resource augmentation in load balancing.
- Batched bin packing
- Fast algorithms for bin packing
- Algorithms for the Relaxed Online Bin-Packing Model
- On the online bin packing problem
- Parametric Lower Bound for On-Line Bin-Packing
- A simple on-line bin-packing algorithm
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
- Improved Space for Bounded-Space, On-Line Bin-Packing
- Speed is as powerful as clairvoyance
- On-line bin packing in linear time
- Resource augmentation for online bounded space bin packing
- On Certain Nonlinear Recurring Sequences
- Approximation and Online Algorithms
- Scheduling in the dark
- Optimal time-critical scheduling via resource augmentation
This page was built for publication: Resource augmented semi-online bounded space bin packing
