Anchored rectangle and square packings
type: Item
instance of: scholarly article
title: Anchored rectangle and square packings
zbMATH Open document ID: 1387.52030
author: Kevin Balas
author: Adrian Dumitrescu
author: Csaba D. Tóth
published in: Discrete Optimization
publication date: 2018-05-24T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/5905/
Mathematics Subject Classification ID: 52C15
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6872152
zbMATH Keywords: rectangle packing
zbMATH Keywords: anchored rectangle
zbMATH Keywords: greedy algorithm
zbMATH Keywords: charging scheme
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
OpenAlex ID: W2963124996
cites work: On the number of anchored rectangle packings for a planar point set
cites work: Packing anchored rectangles
cites work: Polynomial-time approximation schemes for packing and piercing fat objects
cites work: Improved Approximation Algorithm for Two-Dimensional Bin Packing
cites work: A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem
cites work: Q5674034
cites work: Some Covering Theorems (I)
cites work: Some Covering Theorems (II)
cites work: Some Covering Theorems (III)
cites work: MAXIMUM AREA INDEPENDENT SETS IN DISK INTERSECTION GRAPHS
cites work: On covering problems of Rado
cites work: Computing the Largest Empty Rectangle
cites work: On the largest empty axis-parallel box amidst \(n\) points
cites work: Point labeling with sliding labels
cites work: Elastic labels around the perimeter of a map
cites work: Labeling points with given rectangles
cites work: LABELING POINTS WITH RECTANGLES OF VARIOUS SHAPES
cites work: Q5587076
cites work: Q5424207
cites work: Label placement by maximum independent set in rectangles
cites work: A combinatorial theorem on labeling squares with points and its application
cites work: MULTI COVER OF A POLYGON MINIMIZING THE SUM OF AREAS
cites work: Algorithms – ESA 2005
cites work: A constant-factor approximation for multi-covering with disks
cites work: Q4680560
cites work: Approximation algorithms for maximum independent set of pseudo-disks
cites work: Q4633902
cites work: Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
cites work: A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices
cites work: Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons
cites work: On Steiner’s Problem with Rectilinear Distance
DOI: 10.1016/J.DISOPT.2017.08.003
description: scientific article; zbMATH DE number 6872152