Optimal Analysis of Best Fit Bin Packing

DOI10.1007/978-3-662-43948-7_36zbMath1423.90219OpenAlexW14327270MaRDI QIDQ5167762

György Dósa, Jiří Sgall

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43948-7_36

zbMATH Keywords

absolute approximation ratiomatching lower bounds

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (16)

Online bin packing with overload cost ⋮ Online Colored Bin Packing ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Batched bin packing revisited ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ A 4-space bounded approximation algorithm for online bin packing problem ⋮ Using weight decision for decreasing the price of anarchy in selfish bin packing games ⋮ Colored bin packing: online algorithms and lower bounds ⋮ Unnamed Item ⋮ On bin packing with clustering and bin packing with delays ⋮ Best fit bin packing with random order revisited ⋮ The optimal absolute ratio for online bin packing ⋮ A general bin packing game: interest taken into account ⋮ Max-min bin packing algorithm and its application in nano-particles filling ⋮ Best Fit Bin Packing with Random Order Revisited ⋮ The tight absolute bound of First Fit in the parameterized case

This page was built for publication: Optimal Analysis of Best Fit Bin Packing