A near-linear constant-factor approximation for euclidean bipartite matching?

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2004, Pages 247-252

  Agarwal, Pankaj K ^a   Varadarajan, Kasturi R ^b  

^a Duke University   (United States)

^b University of Iowa   (United States)

Author keywords

Approximation algorithms; Matching

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; EUCLIDEAN BIPARTITE MATCHING; POLYNOMIAL TIME ALGORITHM;

COMPUTATIONAL GEOMETRY;

EID: 4544368960     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/997817.997856     Document Type: Conference Paper

References (14)

1. P. K. Agarwal, A. Efrat, and M. Sharir. Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 39-50, 1995.
2. P. K. Agarwal and K. R. Varadarajan. Approximation algorithms for bipartite and non-bipartite matching in the plane. Proc. SODA 99.
3. S. Arora. Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. In Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci., pages 554-563, 1997.
4. D. S. Atkinson and P. M. Vaidya. Using geometry to solve the transportation problem in the plane. Algorithmica, 13:442-461, 1995.
5. Paul B. Callahan and S. Rao Kosaraju. Faster algorithms for some geometric graph problems in higher dimensions. In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 291-300, 1993.
6. J. Edmonds. Maximum matching and a polyhedron with (0,1) vertices. J. Res. National Bureau of Standards, 69B:125-130, 1965.
7. H. Gabow and R. Tarjan. Faster scaling algorithms for network problems. SIAM J. Comput., 18:1013-1036, 1989.
8. Z. Galil, S. Micali, and H. N. Gabow. Priority queues with variable priority and an o(ev log v) algorithm for finding a maximal weighted matching in general graphs. In Proc. 22nd Annual IEEE Symposium on Foundations of Computer Science, pages 255-261, 1982.
9. H. Kuhn. The Hungarian method for the assignment problem. Naval Res. Logist. Q., 2:83-97, 1955.
10. E. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart & Winston, New York, 1976.
11. S. B. Rao and W. D. Smith. Improved approximation schemes for traveling salesman tours. In Proc. 30th Annu. ACM Sympos. Theory Comput., 1998.
12. P. M. Vaidya. Approximate minimum weight matching on points in k-dimensional space. Algorithmica, 4:569-583, 1989.
13. P. M. Vaidya. Geometry helps in matching. SIAM J. Comput., 18:1201-1225, 1989.
14. Kasturi R. Varadarajan. A divide-and-conquer algorithm for min-cost perfect matching in the plane. In Proc. FOCS 98.