Black and White Bin Packing Revisited

DOI10.1007/978-3-319-26626-8_4zbMath1478.90102OpenAlexW2295236305MaRDI QIDQ3467833

Jing Chen, Xin Han, Wolfgang W. Bein, Hing-Fung Ting

Publication date: 5 February 2016

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_4

zbMATH Keywords

bin packing problem``better than 3 competitive algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• New lower bounds for certain classes of bin packing algorithms
• On the absolute approximation ratio for first fit and related results
• Tighter bounds of the First Fit algorithm for the bin-packing problem
• Online results for black and white bin packing
• Black and White Bin Packing
• Colorful Bin Packing
• Online Colored Bin Packing
• On the online bin packing problem
• A simple on-line bin-packing algorithm
• `` Strong NP-Completeness Results

This page was built for publication: Black and White Bin Packing Revisited