Approximation Algorithms for Demand Strip Packing

DOI10.4230/lipics.approx/random.2021.20arXiv2105.08577OpenAlexW3202162828MaRDI QIDQ6090894

Fabrizio Grandoni, Afrouz Jabal Ameli, Waldo Gálvez, Kamyar Khodamoradi

Publication date: 20 November 2023

Full work available at URL: https://arxiv.org/abs/2105.08577

zbMATH Keywords

approximation algorithmsstrip packingtwo-dimensional packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (3)

Lower bounds on the performance of online algorithms for relaxed packing problems ⋮ Tight approximation algorithms for geometric bin packing with skewed items ⋮ Peak demand minimization via sliced strip packing

This page was built for publication: Approximation Algorithms for Demand Strip Packing