License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2020.84
URN: urn:nbn:de:0030-drops-124916
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/12491/
Go to the corresponding LIPIcs Volume Portal

Merino, Arturo ; Wiese, Andreas

On the Two-Dimensional Knapsack Problem for Convex Polygons

pdf-format:
LIPIcs-ICALP-2020-84.pdf (0.6 MB)

Abstract

We study the two-dimensional geometric knapsack problem for convex polygons. Given a set of weighted convex polygons and a square knapsack, the goal is to select the most profitable subset of the given polygons that fits non-overlappingly into the knapsack. We allow to rotate the polygons by arbitrary angles. We present a quasi-polynomial time O(1)-approximation algorithm for the general case and a polynomial time O(1)-approximation algorithm if all input polygons are triangles, both assuming polynomially bounded integral input data. Also, we give a quasi-polynomial time algorithm that computes a solution of optimal weight under resource augmentation, i.e., we allow to increase the size of the knapsack by a factor of 1+δ for some δ > 0 but compare ourselves with the optimal solution for the original knapsack. To the best of our knowledge, these are the first results for two-dimensional geometric knapsack in which the input objects are more general than axis-parallel rectangles or circles and in which the input polygons can be rotated by arbitrary angles.

BibTeX - Entry

@InProceedings{merino_et_al:LIPIcs:2020:12491,
  author =	{Arturo Merino and Andreas Wiese},
  title =	{{On the Two-Dimensional Knapsack Problem for Convex Polygons}},
  booktitle =	{47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
  pages =	{84:1--84:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-138-2},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{168},
  editor =	{Artur Czumaj and Anuj Dawar and Emanuela Merelli},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/12491},
  URN =		{urn:nbn:de:0030-drops-124916},
  doi =		{10.4230/LIPIcs.ICALP.2020.84},
  annote =	{Keywords: Approximation algorithms, geometric knapsack problem, polygons, rotation}
}

Keywords: Approximation algorithms, geometric knapsack problem, polygons, rotation
Collection: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Issue Date: 2020
Date of publication: 29.06.2020

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI