Resource augmented semi-online bounded space bin packing

DOI10.1016/J.DAM.2009.03.015zbMATH Open1209.90336OpenAlexW1993445265MaRDI QIDQ967321FDOQ967321

Authors: Leah Epstein, Elena Kleiman 

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

Recommendations

• Resource augmentation for online bounded space bin packing
• scientific article; zbMATH DE number 1134660
• scientific article; zbMATH DE number 1670832
• Two-bounded-space bin packing revisited
• Repacking helps in bounded space on-line bin-packing

zbMATH Keywords

bin packingonline problemsrepacking

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Programming involving graphs or networks (90C35) Analysis of algorithms (68W40)

Cites Work

• Title not available (Why is that?)
• Speed is as powerful as clairvoyance
• Repacking helps in bounded space on-line bin-packing
• Algorithms for the relaxed online bin-packing model
• On the online bin packing problem
• A simple on-line bin-packing algorithm
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Title not available (Why is that?)
• A fundamental restriction on fully dynamic maintenance of bin packing
• An improved lower bound for on-line bin packing algorithms
• Fast algorithms for bin packing
• Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
• On-line bin packing in linear time
• Improved Space for Bounded-Space, On-Line Bin-Packing
• Batched bin packing
• Optimal time-critical scheduling via resource augmentation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Scheduling in the dark
• On Certain Nonlinear Recurring Sequences
• Resource augmentation for online bounded space bin packing
• Paging with connections: FIFO strikes again
• Resource augmentation in load balancing.
• Parametric Lower Bound for On-Line Bin-Packing
• Approximation and Online Algorithms

Cited In (6)

• Semi-on-line bin packing: a short overview and a new lower bound
• Algorithms for the on-line bin packing problem with repacking
• Repacking helps in bounded space on-line bin-packing
• Title not available (Why is that?)
• Tight bounds for NF-based bounded-space online bin packing algorithms
• Resource augmentation for online bounded space bin packing

This page was built for publication: Resource augmented semi-online bounded space bin packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q967321)