Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles
From MaRDI portal
Publication:2775900
DOI10.1006/jagm.2001.1188zbMath0999.68248OpenAlexW2026653490WikidataQ29543658 ScholiaQ29543658MaRDI QIDQ2775900
No author found.
Publication date: 8 July 2002
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/7dea66fd343fb47696c7a3ab99024511079680d8
Related Items (16)
Approximation algorithms on consistent dynamic map labeling ⋮ Approximating points by a piecewise linear function ⋮ Geometric representation of graphs in low dimension using axis parallel boxes ⋮ Aspects of a multivariate complexity analysis for rectangle tiling ⋮ Cubicity and bandwidth ⋮ Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane ⋮ Approximation algorithms for maximum independent set of pseudo-disks ⋮ On the speed of algebraically defined graph classes ⋮ Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking ⋮ Admission control with advance reservations in simple networks ⋮ Independent set of intersection graphs of convex objects in 2D ⋮ Minimum vertex cover in rectangle graphs ⋮ RELATIONS BETWEEN TWO COMMON TYPES OF RECTANGULAR TILINGS ⋮ An upper bound for cubicity in terms of boxicity ⋮ A note on maximum independent sets in rectangle intersection graphs ⋮ On the Cubicity of AT-Free Graphs and Circular-Arc Graphs
This page was built for publication: Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles
