Almost optimal inapproximability of multidimensional packing problems

DOI10.1109/FOCS52979.2021.00033MaRDI QIDQ6943519zbMATH OpenFDO

Authors Sai Sandeep

Publication date 13 August 2025

Full work available at URL https://doi.org/10.1109/FOCS52979.2021.00033

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06)

Cited in

(1)

• Improved hardness of approximation for geometric bin packing

This page was built for publication: Almost optimal inapproximability of multidimensional packing problems

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