A Near-linear Time ϵ-Approximation Algorithm for Geometric Bipartite Matching

Journal Article

© 2020 ACM. For point sets A, B ⊂ Rd, |A| = |B| = n, and for a parameter ϵ > 0, we present a Monte Carlo algorithm that computes, in O(npoly(log n, 1/ϵ)) time, an ϵ-approximate perfect matching of A and B under any Lp-norm with high probability; the previously best-known algorithm takes Ω(n3/2) time. We approximate the Lp-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, within a polylogarithmic factor, 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(npoly(log n, 1/ϵ)).

Full Text

Duke Authors

Cited Authors

  • Raghvendra, S; Agarwal, PK

Published Date

  • May 1, 2020

Published In

Volume / Issue

  • 67 / 3

Electronic International Standard Serial Number (EISSN)

  • 1557-735X

International Standard Serial Number (ISSN)

  • 0004-5411

Digital Object Identifier (DOI)

  • 10.1145/3393694

Citation Source

  • Scopus