English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union

MPS-Authors
/persons/resource/persons228472

Nusser,  André
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Künnemann, M., & Nusser, A. (2022). Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union. In S. Naor, & N. Buchbinder (Eds.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 3181-3201). Philadelphia, PA: SIAM. doi:10.1137/1.9781611977073.


Cite as: https://hdl.handle.net/21.11116/0000-000C-1F8F-2
Abstract
There is no abstract available