Tight results for next fit and worst fit with resource augmentation

DOI10.1016/J.TCS.2010.03.019zbMath1207.68453OpenAlexW2053613667MaRDI QIDQ974751

Asaf Levin, Leah Epstein, Joan. Boyar

Publication date: 7 June 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.03.019

zbMATH Keywords

bin packingresource augmentationnext fitworst fit

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (4)

Relative Worst-Order Analysis: A Survey ⋮ On the absolute approximation ratio for first fit and related results ⋮ The resource dependent assignment problem with a convex agent cost function ⋮ Comparing the costs of any fit algorithms for bin packing

Cites Work

• Unnamed Item
• Fast algorithms for bin packing
• Online bin packing with resource augmentation
• A simple on-line bin-packing algorithm
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Speed is as powerful as clairvoyance
• Resource augmentation for online bounded space bin packing

This page was built for publication: Tight results for next fit and worst fit with resource augmentation