Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing

DOI10.1137/0222004zbMATH Open0767.68059OpenAlexW1981964469MaRDI QIDQ4037682FDOQ4037682

Authors Weizhen Mao 

Publication date 16 May 1993

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0222004

zbMATH Keywords

bin packingapproximate algorithmworst-case performance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Recommendations

• Best \(k\)-fit bin packing
• Optimal analysis of best fit bin packing
• Publication:4205077
• scientific article; zbMATH DE number 3952477
• scientific article; zbMATH DE number 563208

Cited in

(12)

• Worst-case analysis of fast heuristics for packing squares into a square
• scientific article; zbMATH DE number 3997164 (Why is no real title available?)
• Tight results for next fit and worst fit with resource augmentation
• Algorithm NextFit for the bin packing problem
• A 4-space bounded approximation algorithm for online bin packing problem
• Tighter bounds for the harmonic bin packing algorithm
• Best \(k\)-fit bin packing
• A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing
• scientific article; zbMATH DE number 3952477 (Why is no real title available?)
• Next-fit packs a list and its reverse into the same number of bins
• On-line bin packing ? A restricted survey
• scientific article; zbMATH DE number 4125007 (Why is no real title available?)

This page was built for publication: Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing

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