On the complexity of anchored rectangle packing

DOI10.4230/LIPICS.ESA.2019.8MaRDI QIDQ5075741zbMATH OpenOpenAlexFDO

Authors Antonios Foivos Antoniadis, Felix Biermeier, Andrés Cristi, Christoph Damerius, Ruben Hoeksma, Dominik Kaaser, Peter Kling, Lukas Nölke

Publication date 11 May 2022

Full work available at URL https://doi.org/10.4230/LIPIcs.ESA.2019.8

zbMATH Keywords

hardnessrectangle packingPTASresource augmentationNPanchored rectangle

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Anchored rectangle and square packings
• Anchored rectangle and square packings
• Maximum area axis-aligned square packings
• On the number of anchored rectangle packings for a planar point set

Cites work

• scientific article; zbMATH DE number 3305794 (Why is no real title available?)
• A quasi-PTAS for the two-dimensional geometric knapsack problem
• Anchored rectangle and square packings
• Face covers and the genus problem for apex graphs
• How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking
• Improved approximation algorithm for two-dimensional bin packing
• Mathematical mind-benders
• Maximum area axis-aligned square packings
• Maximum area independent sets in disk intersection graphs
• Multicommodity demand flow in a tree and packing integer programs
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• On covering problems of Rado
• Some Covering Theorems (I)
• Some Covering Theorems (II)
• Some Covering Theorems (III)

This page was built for publication: On the complexity of anchored rectangle packing

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