@InProceedings{buchem_et_al:LIPIcs.SoCG.2024.26,
author = {Buchem, Moritz and Deuker, Paul and Wiese, Andreas},
title = {{Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically}},
booktitle = {40th International Symposium on Computational Geometry (SoCG 2024)},
pages = {26:1--26:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-316-4},
ISSN = {1868-8969},
year = {2024},
volume = {293},
editor = {Mulzer, Wolfgang and Phillips, Jeff M.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.26},
URN = {urn:nbn:de:0030-drops-199716},
doi = {10.4230/LIPIcs.SoCG.2024.26},
annote = {Keywords: Geometric packing, approximation algorithms, dynamic algorithms}
}