A near-linear time \(\epsilon\)-approximation algorithm for geometric
bipartite matching
R. Sharathkumar, and P. Agarwal. Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012, page 385--394. (2012)
DOI: 10.1145/2213977.2214014
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 DBLP:conf/stoc/SharathkumarA12
%A Sharathkumar, R.
%A Agarwal, Pankaj K.
%B Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012
%D 2012
%K algorithms approximation bipartitematching matching quadtree
%P 385--394
%R 10.1145/2213977.2214014
%T A near-linear time \(\epsilon\)-approximation algorithm for geometric
bipartite matching
%U http://doi.acm.org/10.1145/2213977.2214014
@inproceedings{DBLP:conf/stoc/SharathkumarA12,
added-at = {2016-02-03T06:45:28.000+0100},
author = {Sharathkumar, R. and Agarwal, Pankaj K.},
bibsource = {dblp computer science bibliography, http://dblp.org},
biburl = {https://www.bibsonomy.org/bibtex/20d53f6506f6b5400c7895ff49fc819ca/prathyush},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference, {STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
crossref = {DBLP:conf/stoc/2012},
doi = {10.1145/2213977.2214014},
interhash = {521d22b50ea1fb41fe3f20f7d7dcd74c},
intrahash = {0d53f6506f6b5400c7895ff49fc819ca},
keywords = {algorithms approximation bipartitematching matching quadtree},
pages = {385--394},
timestamp = {2017-10-09T15:51:50.000+0200},
title = {A near-linear time {\(\epsilon\)}-approximation algorithm for geometric
bipartite matching},
url = {http://doi.acm.org/10.1145/2213977.2214014},
year = 2012
}