Improved approximations for vector bin packing via iterative randomized rounding

DOI10.1109/FOCS57990.2023.00084MaRDI QIDQ6942884zbMATH OpenFDO

Authors Matthias Mnich, Ariel Kulik, Hadas Shachnai

Publication date 15 August 2025

Full work available at URL https://doi.org/10.1109/FOCS57990.2023.00084

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(5)

• An EPTAS for cardinality constrained multiple knapsack via iterative randomized rounding
• Improved approximation for two-dimensional vector multiple knapsack
• Price-and-branch heuristic for vector bin packing
• Max-min and 1-bounded space algorithms for the bin packing problem
• Improved approximation guarantees for advertisement placement

This page was built for publication: Improved approximations for vector bin packing via iterative randomized rounding

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