On the two-dimensional knapsack problem for convex polygons

DOI10.4230/LIPICS.ICALP.2020.84MaRDI QIDQ6842487zbMATH OpenFDO

Authors Arturo I. Merino, Andreas Wiese

Publication date 18 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

zbMATH Keywords

approximation algorithmspolygonsrotationgeometric knapsack problem

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

This page was built for publication: On the two-dimensional knapsack problem for convex polygons

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