𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems

✍ Scribed by Kovaleva, Sofia; Spieksma, Frits C. R.

Book ID
118198908
Publisher
Society for Industrial and Applied Mathematics
Year
2006
Tongue
English
Weight
242 KB
Volume
20
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Constant Ratio Approximation Algorithms
Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
✍ Daya Ram Gaur; Toshihide Ibaraki; Ramesh Krishnamurti πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 114 KB

We provide constant ratio approximation algorithms for two NP-hard problems, the rectangle stabbing problem and the rectilinear partitioning problem. In the rectangle stabbing problem, we are given a set of rectangles in two-dimensional space, with the objective of stabbing all rectangles with the m

Efficient Approximation Algorithms for T
Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles
✍ Piotr Berman; Bhaskar DasGupta; S Muthukrishnan; Suneeta Ramaswami πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 202 KB

We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE, and d-RPACK) studied in the literature. Most of our algorithms are highly efficient since their running times are near-linear in the sparse input size rather than in the domain size. In add