Geometric stabbing via threshold rounding and factor revealing LPs

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Approximation algorithms for maximum independent set of pseudo-disks
Improved results on geometric hitting set problems
Constant approximation algorithms for rectangle stabbing and related problems
Geometric hitting set for segments of few orientations
Almost optimal set covers in finite VC-dimension
Packing and covering with non-piercing regions
The parameterized complexity of stabbing rectangles
The Roberts characterization of proper and unit interval graphs
Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set
Weighted geometric set cover via quasi-uniform sampling
On the set multicover problem in geometric settings
Weighted geometric set multi-cover via quasi-uniform sampling
Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier
Fast approximation algorithms for a nonconvex covering problem
Approximation Schemes for Covering and Packing
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
Planar Support for Non-piercing Regions and Applications
A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices
Algorithms – ESA 2004
Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems
Coloring and Maximum Weight Independent Set of Rectangles

This page was built for publication: Geometric stabbing via threshold rounding and factor revealing LPs