On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
From MaRDI portal
Publication:3591341
DOI10.1007/11809678_33zbMath1162.68449OpenAlexW1526652389MaRDI QIDQ3591341
Fencol C. C. Yung, Prudence W. H. Wong, Wun-Tat Chan
Publication date: 10 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11809678_33
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
This page was built for publication: On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis