Go to the corresponding LIPIcs Volume Portal 
Merino, Arturo ; Wiese, Andreas
pdfformat: 

@InProceedings{merino_et_al:LIPIcs:2020:12491, author = {Arturo Merino and Andreas Wiese}, title = {{On the TwoDimensional Knapsack Problem for Convex Polygons}}, booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, pages = {84:184:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771382}, ISSN = {18688969}, year = {2020}, volume = {168}, editor = {Artur Czumaj and Anuj Dawar and Emanuela Merelli}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12491}, URN = {urn:nbn:de:0030drops124916}, 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 