A PTAS for the horizontal rectangle stabbing problem

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Approximation algorithms (68W25) Randomized algorithms (68W20)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Exact algorithms and APX-hardness results for geometric packing and covering problems
A $(5/3+\varepsilon)$-approximation for strip packing
Approximating the generalized minimum Manhattan network problem
Almost optimal set covers in finite VC-dimension
A PTAS for the horizontal rectangle stabbing problem
Approximation and online algorithms for multidimensional bin packing: a survey
Batch processing with interval graph compatibilities between tasks
Weighted geometric set cover via quasi-uniform sampling
Latency-constrained aggregation in sensor networks
Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem
Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
Approximation schemes for covering and packing problems in image processing and VLSI
A Greedy Heuristic for the Set-Covering Problem
The Geometry of Scheduling
Improved Approximation Algorithm for Two-Dimensional Bin Packing
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems
Dynamic Geometric Set Cover and Hitting Set
A Tight (3/2+ε) Approximation for Skewed Strip Packing.
On Guillotine Separability of Squares and Rectangles.
Peak Demand Minimization via Sliced Strip Packing.
Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items
A PTAS for packing hypercubes into a knapsack
Tight approximation algorithms for two-dimensional guillotine strip packing
Dynamic geometric set cover, revisited
Geometry meets vectors: approximation algorithms for multidimensional packing
Online and dynamic algorithms for geometric set cover and hitting set

This page was built for publication: A PTAS for the horizontal rectangle stabbing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589763)