A Collection of Lower Bounds for Online Matching on the Line

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10807)


In the online matching on the line problem, the task is to match a set of requests R online to a given set of servers S. The distance metric between any two points in \(R\,\cup \,S\) is a line metric and the objective for the online algorithm is to minimize the sum of distances between matched server-request pairs. This problem is well-studied and – despite recent improvements – there is still a large gap between the best known lower and upper bounds: The best known deterministic algorithm for the problem is \(O(\log ^2n)\)-competitive, while the best known deterministic lower bound is 9.001. The lower and upper bounds for randomized algorithms are 4.5 and \(O(\log n)\) respectively.

We prove that any deterministic online algorithm which in each round: (i) bases the matching decision only on information local to the current request, and (ii) is symmetric (in the sense that the decision corresponding to the mirror image of some instance I is the mirror image of the decision corresponding to instance I), must be \(\varOmega (\log n)\)-competitive. We then extend the result by showing that it also holds when relaxing the symmetry property so that the algorithm might prefer one side over the other, but only up to some degree. This proves a barrier of \(\varOmega (\log n)\) on the competitive ratio for a large class of “natural” algorithms. This class includes all deterministic online algorithms found in the literature so far.

Furthermore, we show that our result can be extended to randomized algorithms that locally induce a symmetric distribution over the chosen servers. The \(\varOmega (\log n)\)-barrier on the competitive ratio holds for this class of algorithms as well.


  1. 1.
    Antoniadis, A., Barcelo, N., Nugent, M., Pruhs, K., Scquizzato, M.: A o(n)-competitive deterministic algorithm for online matching on a line. In: Proceedings of 12th International Workshop Approximations and Online Algorithms (WAOA), pp. 11–22 (2014)Google Scholar
  2. 2.
    Bansal, N., Buchbinder, N., Gupta, A., Naor, J.: A randomized o(log2 k)-competitive algorithm for metric bipartite matching. Algorithmica 68(2), 390–403 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Chung, C., Pruhs, K., Uthaisombut, P.: The online transportation problem: on the exponential boost of one extra server. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 228–239. Springer, Heidelberg (2008). CrossRefGoogle Scholar
  4. 4.
    Fuchs, B., Hochstättler, W., Kern, W.: Online matching on a line. Theo. Comput. Sci. 332(1–3), 251–264 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Gupta, A., Lewi, K.: The online metric matching problem for doubling metrics. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7391, pp. 424–435. Springer, Heidelberg (2012). CrossRefGoogle Scholar
  6. 6.
    Kalyanasundaram, B., Pruhs, K.: Online weighted matching. J. Algorithms 14(3), 478–488 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Kalyanasundaram, B., Pruhs, K.: The online transportation problem. SIAM J. Discrete Math. 13(3), 370–383 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Khuller, S., Mitchell, S.G., Vazirani, V.V.: On-line algorithms for weighted bipartite matching and stable marriages. Theo. Comput. Sci. 127(2), 255–267 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Koutsoupias, E.: The k-server problem. Comput. Sci. Rev. 3(2), 105–118 (2009)CrossRefzbMATHGoogle Scholar
  10. 10.
    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). CrossRefGoogle Scholar
  11. 11.
    Meyerson, A., Nanavati, A., Poplawski, L.J.: Randomized online algorithms for minimum metric bipartite matching. In: Proceedings of 17th Symposium Discrete Algorithms (SODA), pp. 954–959 (2006)Google Scholar
  12. 12.
    Nayyar, K., Raghvendra, S.: An input sensintive online algorithm for the metric bipartite matching problem. In: FOCS (2017, to appear).
  13. 13.
    Raghvendra, S.: A robust and optimal online algorithm for minimum metric bipartite matching. In: Approximation, Randomization, and Combinatorial Optimization, APPROX/RANDOM, pp. 18:1–18:16 (2016)Google Scholar
  14. 14.
    van Stee, R.: SIGACT news online algorithms column 27: online matching on the line, part 1. SIGACT News 47(1), 99–110 (2016)MathSciNetCrossRefGoogle Scholar
  15. 15.
    van Stee, R.: SIGACT news online algorithms column 28: online matching on the line, part 2. SIGACT News 47(2), 40–51 (2016)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of BonnBonnGermany
  2. 2.Universität des Saarlandes and Max Plank Institut für Informatik, Saarland CampusSaarbrückenGermany
  3. 3.Departamento de Ingeniería MatemáticaUniversidad de ChileSantiagoChile

Personalised recommendations