Randomized online algorithms for minimum metric bipartite matching

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 954-959

  Meyerson, Adam ^a   Nanavati, Akash ^b   Poplawski, Laura ^a  

^a University of California   (United States)

^b GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE MATCHING; GREEDY ALGORITHM; ONLINE ALGORITHMS;

METRIC SYSTEM; ONLINE SYSTEMS; RANDOM PROCESSES; TREES (MATHEMATICS);

ALGORITHMS;

EID: 33244474449     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109662     Document Type: Conference Paper

References (10)

1. Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. 37th IEEE Symposium on Foundations of Computer Science, 1996.
2. Y. Bartal. On approximating arbitrary metrics by tree metrics. 30th ACM Symposium on Theory of Computing, 1998.
3. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. ACM Symposium on Theory of Computing, 2003.
4. B. Fuchs, W. Hochstattler, and W. Kern. Online matching on a line. Theoretical Computer Science 332(1-3), 2005.
5. B. Kalyanasundaram and K. Pruhs. Online weighted matching. Journal of Algorithms 14(3) (also SODA 1991), 1993.
6. B. Kalyanasundaram and K. Pruhs. Online transportation problem. Journal of Discrete Mathematics 13(3) (also ESA 1995), 2000.
7. R. Karp, U. Vazirani, and V. Vazirani. An optimal algorithm for online bipartite matching. 22nd ACM Symposium on Theory of Computing, 1990.
8. S. Khuller, S. Mitchell, and V. Vazirani. On-line algorithms for weighted bipartite matching and stable marriages. Theory of Computer Science 127(2), 1994.
9. E. Koutsoupias and A. Nanavati. The online matching problem on a line. Workshop on Approximation and Online Algorithms, 2003.
10. E. Koutsoupias and C. Papadimitriou. On the k-server conjecture. Journal of the ACM 42(5), 1995.