Tight results for next fit and worst fit with resource augmentation
type: Item
instance of: scholarly article
title: Tight results for next fit and worst fit with resource augmentation
zbMATH Open document ID: 1207.68453
author: Leah Epstein
author: Asaf Levin
author: Joan Boyar
published in: Theoretical Computer Science
publication date: 2010-06-07T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5717739
zbMATH Keywords: bin packing
zbMATH Keywords: next fit
zbMATH Keywords: worst fit
zbMATH Keywords: resource augmentation
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.03.019
OpenAlex ID: W2053613667
cites work: Q4223058
cites work: Resource augmentation for online bounded space bin packing
cites work: Online bin packing with resource augmentation
cites work: Fast algorithms for bin packing
cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
cites work: Speed is as powerful as clairvoyance
cites work: A simple on-line bin-packing algorithm
DOI: 10.1016/J.TCS.2010.03.019
description: scientific article; zbMATH DE number 5717739