Approximating Geometric Knapsack via L-packings
From MaRDI portal
Publication:5035877
DOI10.1145/3473713OpenAlexW3203979862MaRDI QIDQ5035877
Andreas Wiese, Fabrizio Grandoni, Salvatore Ingala, Sandy Heydrich, Arindam Khan, Waldo Gálvez
Publication date: 22 February 2022
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.07710
Related Items (7)
A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing ⋮ Tight approximation algorithms for geometric bin packing with skewed items ⋮ Peak demand minimization via sliced strip packing ⋮ Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints ⋮ On improved interval cover mechanisms for crowdsourcing markets ⋮ Improved Online Algorithms for Knapsack and GAP in the Random Order Model ⋮ Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack
This page was built for publication: Approximating Geometric Knapsack via L-packings
