On the complexity of anchored rectangle packing

DOI10.4230/LIPICS.ESA.2019.8OpenAlexW2977596275MaRDI QIDQ5075741FDOQ5075741

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

Recommendations

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

zbMATH Keywords

hardnessrectangle packingPTASresource augmentationNPanchored rectangle

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

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

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)