An Improved Approximation Scheme for Variable-Sized Bin Packing

DOI10.1007/978-3-642-32589-2_47zbMath1365.68468OpenAlexW2641205488MaRDI QIDQ2912752

Stefan Kraft, Klaus Jansen

Publication date: 25 September 2012

Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32589-2_47

zbMATH Keywords

bin packingintegrality gapvariable-sized bin packingAFPTASasymptotic fully polynomial approximation scheme

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (2)

A faster FPTAS for the unbounded knapsack problem ⋮ An improved approximation scheme for variable-sized bin packing

This page was built for publication: An Improved Approximation Scheme for Variable-Sized Bin Packing