An O(log2 k)-competitive algorithm for metric bipartite matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4698 LNCS, Issue , 2007, Pages 522-533

  Bansal, Nikhil ^a   Buchbinder, Niv ^b   Gupta, Anupam ^c   Naor, Joseph ^b,d  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c Carnegie Mellon University   (United States)

^d MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; PROBLEM SOLVING;

DETERMINISTIC ALGORITHM; K VERTICES; METRIC BIPARTITE MATCHING;

ALGORITHMS;

EID: 38049017660     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75520-3_47     Document Type: Conference Paper

References (23)

1. Baeza-Yates, R.A., Culberson, J.C., Rawlins, G.J: Searching in the plane. Information and Computation 106(2), 234-252 (1993)
2. Bartal, Y.: Probabilistic approximations of metric spaces and its algorithmic applications. In: IEEE Symposium on Foundations of Computer Science, pp. 184-193. IEEE Computer Society Press, Los Alamitos (1996)
3. Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: STOC: ACM Symposium on Theory of Computing (STOC), ACM Press, New York (1998)
4. SBuchbinder, N., Jain, K., Naor, J.: The adauctions problem and extensions. In: ESA (to appear 2007)
5. Chung, C., Pruhs, K., Uthaisombut, P.: The online transportation problem: On the exponential boost of one extra server. Under submission
6. Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pp. 448-455. ACM Press, New York (2003)
7. Fuchs, B., Hochstattler, W., Kern, W.: Online matching on a line. Theoretical Computer Science, 251-264 (2005)
8. Goemans, M.X., Williamson, D.P.: A General Approximation Technique for Constrained Forest Problems. SIAM Journal on Computing 24, 296-317 (1995)
9. Kalyanasundaram, B., Pruhs, K.: Online weighted matching. J. Algorithms 14(3), 478-488 (1993)
10. Kalyanasundaram, B., Pruhs, K.: Online network optimization problems, 1998. In: Fiat, A., Woeginger, G. (eds.) Online Algorithms. LNCS, vol. 1442, Springer, Heidelberg (1998)
11. Kalyanasundaram, B., Pruhs, K.: The online transportation problem. SIAM J. Discrete Math. 13(3), 370-383 (2000)
12. Kalyanasundaram, B., Pruhs, K.: An optimal deterministic algorithm for online b -matching. Theoretical Computer Science 233(1-2), 319-325 (2000)
13. Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for online bipartite matching. In: In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pp. 352-358. ACM Press, New York (1990)
14. Khuller, S., Mitchell, S.G., Vazirani, V.V.: On-line algorithms for weighted bipartite matching and stable marriages. Theor. Comput. Sci. 127(2), 255-267 (1994)
15. Koutsoupias, E., Nanavati, A.: The online matching problem on a line. In: Solis-Oba, R., Jansen, K. (eds.) WAOA 2003. LNCS, vol. 2909, pp. 179-191. Springer, Heidelberg (2004)
16. Koutsoupias, E., Papadimitriou, C.: On the k-server conjecture. Journal of the ACM 42(5), 971-983 (1995)
17. Manasse, M.S., McGeoch, L.A., Sleator, D.D.: Competitive algorithms for online problems. In: STOC: ACM Symposium on Theory of Computing, pp. 322-333. ACM Press, New York (1988)
18. Mehta, A., Saberi, A., Vazirani, U.V., Vazirani, V.V.: Adwords and generalized on-line matching. In: IEEE Symposium on Foundations of Computer Science, pp. 264-273. IEEE Computer Society Press, Los Alamitos (2005)
19. Meyerson, A., Nanavati, A., Poplawski, L.: Randomized online algorithms for minimum metric bipartite matching. In: SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp. 954-959. ACM Press, New York (2006)
20. Plaisted, D.A.: Heuristic matching for graphs satisfying the triangle inequality. J. Algorithms 5(2), 163-179 (1984)
21. Reingold, E.M., Tarjan, R.E.: On a greedy heuristic for complete matching. SIAM Journal on Computing 10(4), 676-681 (1981)
22. Schrijver, A.: Combinatorial optimization. Polyhedra and efficiency. Algorithms and Combinatorics, vol. 24. Springer, Berlin (2003)
23. Supowit, K.J., Reingold, E.M., Plaisted, D.A.: The travelling salesman problem and minimum matching in the unit square. SIAM J. Comput. 12(1), 144-156 (1983)