Framework for ER-completeness of two-dimensional packing problems

DOI10.1109/FOCS46700.2020.00098MaRDI QIDQ6943957zbMATH OpenFDO

Authors Tillmann Miltzow, Nadja Seiferth, Mikkel Abrahamsen

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS46700.2020.00098

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(6)

• The complexity of recognizing geometric hypergraphs
• Recognition of unit segment and polyline graphs is \(\exists \mathbb{R} \)-complete
• A practical algorithm with performance guarantees for the art gallery problem
• Geometric embeddability of complexes is \(\exists\mathbb{R}\)-complete
• Approximation schemes for geometric knapsack for packing spheres and fat objects
• Geometric thickness of multigraphs is \(\exists \mathbb{R}\)-complete

This page was built for publication: Framework for ER-completeness of two-dimensional packing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6943957)