Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#235520] of Pankaj K. Agarwal

Papers Published

  1. Agarwal, PK; Ezra, E; Sharir, M, Near-linear approximation algorithms for geometric hitting sets, Proceedings of the Annual Symposium on Computational Geometry (2009), pp. 23-32 [doi]
    (last updated on 2018/11/16)

    Given a set system (X,R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H. We present near-linear 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 axis-parallel d-rectangles in ℝd. In both cases X is either the entire d-dimensional space or a finite set of points in d-space. 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.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320