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

Math @ Duke



Publications [#235550] of Pankaj K. Agarwal

Papers Published

  1. Sharathkumar, R; Agarwal, PK, A near-linear time ε-approximation algorithm for geometric bipartite matching, Proceedings of the Annual ACM Symposium on Theory of Computing (2012), pp. 385-394, ISSN 0737-8017 [doi]
    (last updated on 2018/02/20)

    For point sets A,B ⊂ ℝ d, |A|=|B|=n, and for a parameter ε > 0, we present an algorithm that computes, in O(n poly(log n, 1/ε)) time, an ε-approximate perfect matching of A and B with high probability; the previously best known algorithm takes Ω(n 3/2) time. We approximate the L p-norm using a distance function, d(·,·) based on a randomly shifted quad-tree. The algorithm iteratively generates an approximate minimum-cost augmenting path under d(·,·) in time proportional to the length of the path. We show that the total length of the augmenting paths generated by the algorithm is O((n/ε)log n), implying that the running time of our algorithm is O(n poly(log n,1/ε)). © 2012 ACM.
ph: 919.660.2800
fax: 919.660.2821

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