Published in: LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021)
Mikkel Abrahamsen and Lorenzo Beretta. Online Packing to Minimize Area or Perimeter. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 6:1-6:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{abrahamsen_et_al:LIPIcs.SoCG.2021.6, author = {Abrahamsen, Mikkel and Beretta, Lorenzo}, title = {{Online Packing to Minimize Area or Perimeter}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {6:1--6:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.6}, URN = {urn:nbn:de:0030-drops-138054}, doi = {10.4230/LIPIcs.SoCG.2021.6}, annote = {Keywords: Packing, online algorithms} }
Feedback for Dagstuhl Publishing