Approximating geometric knapsack via L-packings

DOI10.1109/FOCS.2017.32MaRDI QIDQ6946356zbMATH OpenFDO

Authors Waldo Gálvez, Salvatore Ingala, Andreas Wiese, Arindam Khan, Sandy Heydrich, Fabrizio Grandoni

Publication date 6 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2017.32

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(6)

• Breaking the barrier of 2 for the storage allocation problem
• On the two-dimensional knapsack problem for convex polygons
• Approximation algorithms for round-UFP and round-SAP
• On the two-dimensional knapsack problem for convex polygons
• Improved approximation algorithms for 2-dimensional knapsack: packing into multiple l-shapes, spirals, and more
• On guillotine separable packings for the two-dimensional geometric knapsack problem

This page was built for publication: Approximating geometric knapsack via L-packings

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