A near-linear time ε-approximation algorithm for geometric bipartite matching

R. Sharathkumar, Pankaj K. Agarwal. A near-linear time ε-approximation algorithm for geometric bipartite matching. In Howard J. Karloff, Toniann Pitassi, editors, Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012. pages 385-394, ACM, 2012. [doi]

@inproceedings{SharathkumarA12-0,
  title = {A near-linear time ε-approximation algorithm for geometric bipartite matching},
  author = {R. Sharathkumar and Pankaj K. Agarwal},
  year = {2012},
  doi = {10.1145/2213977.2214014},
  url = {http://doi.acm.org/10.1145/2213977.2214014},
  researchr = {https://researchr.org/publication/SharathkumarA12-0},
  cites = {0},
  citedby = {0},
  pages = {385-394},
  booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012},
  editor = {Howard J. Karloff and Toniann Pitassi},
  publisher = {ACM},
  isbn = {978-1-4503-1245-5},
}