A near linear time constant factor approximation for Euclidean bichromatic matching (cost)

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 39-42

  Indyk, Piotr ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

EUCLIDEAN; NEAR-LINEAR TIME;

APPROXIMATION ALGORITHMS;

EID: 84883801664     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. [AES95] P. K. Agarwal, A. Efrat, and M. Sharir. Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. Proceedings of the ACM Symposium on Computational Geometry, 1995.
2. [AV99] P.K. Agarwal and K. Varadarajan. Approximation algorithms for bipartite and non-bipartite matching in the plane. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 1999.
3. [AV04] P. Agarwal and K. Varadarajan. A near-linear constant factor approximation for euclidean matching? Proceedings of the ACM Symposium on Computational Geometry, 2004.
4. [Bar96] Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. Proceedings of the Symposium on Foundations of Computer Science, 1996.
5. [CGKR05] S. Cabello, P. Giannopoulos, C. Knauer, and G. Rote. Matching point sets with respect to the earth mover's distance. Proceedings of the European Symposium on Algorithms, pages 520-531, 2005.
6. [Cha02] M. Charikar. Similarity estimation techniques from rounding. Proceedings of the Symposium on Theory of Computing, 2002.
7. [IT03] P. Indyk and N. Thaper. Fast color image retrieval via embeddings. Workshop on Statistical and Computational Theories of Vision (at ICCV), 2003.
8. [KV05] O. Klein and R. C. Veltkamp. Approximation algorithms for computing the earth mover's distance under transformations. Proceedings of the 16th Annual Symposium on Algorithms and Computation, 2005.
9. [Law76] E. Lawler. Combinatorial optimization: Networks and Matroids. Holt, Rinehart and Winston, 1976.
10. [MR95] R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
11. 1. Proceedings of the Symposium on Foundations of Computer Science, 2006.
12. [RTG00] Y. Rubner, C. Tomassi, and L. J. Guibas. The earth mover's distance as a metric for image retrieval. International Journal of Computer Vision, 40(2):99-121, 2000.
13. [Vai89] P. Vaidya. Geometry helps in matching. SIAM Journal on Computing, 18:1201-1225, 1989.