Efficient approximation algorithms for tiling and packing problems with rectangles
From MaRDI portal
Recommendations
Cited in
(21)- Minimum vertex cover in rectangle graphs
- Aspects of a multivariate complexity analysis for rectangle tiling
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- Tiling with Squares and Packing Dominos in Polynomial Time
- RELATIONS BETWEEN TWO COMMON TYPES OF RECTANGULAR TILINGS
- On the speed of algebraically defined graph classes
- Geometric representation of graphs in low dimension using axis parallel boxes
- Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking
- Approximating points by a piecewise linear function
- Improved approximation algorithms for rectangle tiling and packing.
- A note on maximum independent sets in rectangle intersection graphs
- Admission control with advance reservations in simple networks
- Cubicity and bandwidth
- Approximation algorithms for maximum independent set of pseudo-disks
- An upper bound for cubicity in terms of boxicity
- A survey on the boxicity and cubicity of graphs
- Fully dynamic maximum independent sets of disks in polylogarithmic update time
- Approximation algorithms on consistent dynamic map labeling
- On the cubicity of AT-free graphs and circular-arc graphs
- 4/3 rectangle tiling lower bound
- Independent set of intersection graphs of convex objects in 2D
This page was built for publication: Efficient approximation algorithms for tiling and packing problems with rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2775900)
