A Randomized O(log2k)-Competitive Algorithm for Metric Bipartite Matching

We consider the online metric matching problem in which we are given a metric space, k of whose points are designated as servers. Over time, up to k requests arrive at an arbitrary subset of points in the metric space, and each request must be matched to a server immediately upon arrival, subject to the constraint that at most one request is matched to any particular server. Matching decisions are irrevocable and the goal is to minimize the sum of distances between the requests and their matched servers.We give an O(log2k)-competitive randomized algorithm for the online metric matching problem. This improves upon the best known guarantee of O(log3k) on the competitive factor due to Meyerson, Nanavati and Poplawski (SODA ’06, pp. 954–959, 2006). It is known that for this problem no deterministic algorithm can have a competitive better than 2k−1, and that no randomized algorithm can have a competitive ratio better than lnk.

[1]  Samir Khuller,et al.  On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages , 1991, Theor. Comput. Sci..

[2]  Yair Bartal,et al.  On approximating arbitrary metrices by tree metrics , 1998, STOC '98.

[3]  Lyle A. McGeoch,et al.  Competitive algorithms for on-line problems , 1988, STOC '88.

[4]  Joseph Naor,et al.  Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue , 2007, ESA.

[5]  Edward M. Reingold,et al.  The Travelling Salesman Problem and Minimum Matching in the Unit Square , 1983, SIAM J. Comput..

[6]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[7]  David A. Plaisted.  Heuristic Matching for Graphs Satisfying the Triangle Inequality , 1984, J. Algorithms.

[8]  Kirk Pruhs,et al.  The Online Transportation Problem: On the Exponential Boost of One Extra Server , 2008, LATIN.

[9]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[10]  Richard M. Karp,et al.  An optimal algorithm for on-line bipartite matching , 1990, STOC '90.

[11]  Bernhard Fuchs,et al.  Online Matching On a Line , 2003, Electron. Notes Discret. Math..

[12]  Elias Koutsoupias,et al.  The Online Matching Problem on a Line , 2003, WAOA.

[13]  Yair Bartal,et al.  Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[14]  Bala Kalyanasundaram,et al.  On-line Network Optimization Problems , 1996, Online Algorithms.

[15]  Robert E. Tarjan,et al.  On a Greedy Heuristic for Complete Matching , 1981, SIAM J. Comput..

[16]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[17]  Bala Kalyanasundaram,et al.  The Online Transportation Problem , 2000, SIAM J. Discret. Math..

[18]  Bala Kalyanasundaram,et al.  An optimal deterministic algorithm for online b-matching , 1996, Theor. Comput. Sci..

[19]  Lyle A. McGeoch,et al.  Competitive Algorithms for Server Problems , 1990, J. Algorithms.

[20]  Satish Rao,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.

[21]  Christos H. Papadimitriou,et al.  On the k-server conjecture , 1995, JACM.

[22]  SaberiAmin,et al.  AdWords and generalized online matching , 2007 .

[23]  Bala Kalyanasundaram,et al.  Online Weighted Matching , 1993, J. Algorithms.

[24]  Adam Meyerson,et al.  Randomized online algorithms for minimum metric bipartite matching , 2006, SODA '06.

[25]  Ricardo A. Baeza-Yates,et al.  Searching in the Plane , 1993, Inf. Comput..