Math @ Duke

Publications [#235520] of Pankaj K. Agarwal
Papers Published
 Agarwal, PK; Ezra, E; Sharir, M, Nearlinear approximation algorithms for geometric hitting sets,
Proceedings of the Annual Symposium on Computational Geometry
(2009),
pp. 2332 [doi]
(last updated on 2018/08/18)
Abstract: Given a set system (X,R), the hitting set problem is to find a smallestcardinality subset H ⊆ X, with the property that each range R ∈ R has a nonempty intersection with H. We present nearlinear time approximation algorithms for the hitting set problem, under the following geometric settings: (i) R is a set of planar regions with small union complexity. (ii) R is a set of axisparallel drectangles in ℝd. In both cases X is either the entire ddimensional space or a finite set of points in dspace. The approximation factors yielded by the algorithm are small; they are either the same as or within an O(log n) factor of the best factors known to be computable in polynomial time. © 2009 ACM.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

