Matching on the line admits no $o(\sqrt{\log n})$-competitive algorithm
Data Structures and Algorithms
2021-01-01 v1
Abstract
We present a simple proof that the competitive ratio of any randomized online matching algorithm for the line is at least log2(n+1)/12 for all n=2i−1:i∈N.
Cite
@article{arxiv.2012.15593,
title = {Matching on the line admits no $o(\sqrt{\log n})$-competitive algorithm},
author = {Enoch Peserico and Michele Scquizzato},
journal= {arXiv preprint arXiv:2012.15593},
year = {2021}
}
Related papers
View all related →
Data Structures and Algorithms · Computer Science
An $\Omega(\log n)$ Lower Bound for Online Matching on the Line
Kangning Wang
2021-08-23
Data Structures and Algorithms · Computer Science
On the Advice Complexity of Online Matching on the Line
Béla Csaba, Judit Nagy-György
2024-12-11
Data Structures and Algorithms · Computer Science
A randomized algorithm for the on-line weighted bipartite matching problem
Béla Csaba, András S. Pluhár
2007-06-06
Data Structures and Algorithms · Computer Science
A Collection of Lower Bounds for Online Matching on the Line
Antonios Antoniadis, Carsten Fischer, Andreas Tönnis
2017-12-20
Data Structures and Algorithms · Computer Science
Nearly Tight Bounds for the Online Sorting Problem
Yossi Azar, Debmalya Panigrahi, Or Vardi
2025-08-21
Data Structures and Algorithms · Computer Science
Almost Tight Bounds for Online Hypergraph Matching
Thorben Tröbst, Rajan Udwani
2024-02-15
Data Structures and Algorithms · Computer Science
A lazy approach to on-line bipartite matching
Jakub Kozik, Grzegorz Matecki
2018-05-21
Data Structures and Algorithms · Computer Science
Online Bin Packing with Advice
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz
2013-12-24
Data Structures and Algorithms · Computer Science
An $O(\log n)$-Competitive Posted-Price Algorithm for Online Matching on the Line
Stephen Arndt, Josh Ascher, Kirk Pruhs
2023-10-20
Computational Geometry · Computer Science
Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line
Sharath Raghvendra
2018-03-21
Data Structures and Algorithms · Computer Science
Competitive Paging Algorithms
Amos Fiat, Richard Karp, Mike Luby, Lyle McGeoch +2
2015-06-02
Data Structures and Algorithms · Computer Science
Online Minimum Cost Matching on the Line with Recourse
Nicole Megow, Lukas Nölke
2020-01-10
Data Structures and Algorithms · Computer Science
Online minimum matching with uniform metric and random arrivals
Sharmila Duppala, Karthik A. Sankararaman, Pan Xu
2021-12-13
Data Structures and Algorithms · Computer Science
Scheduling with Obligatory Tests
Konstantinos Dogeas, Thomas Erlebach, Ya-Chun Liang
2024-06-25
Data Structures and Algorithms · Computer Science
A Polylogarithmic-Competitive Algorithm for the k-Server Problem
Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph +1
2011-10-10
Data Structures and Algorithms · Computer Science
Degree-bounded Online Bipartite Matching: OCS vs. Ranking
Yilong Feng, Haolong Li, Xiaowei Wu, Shengwei Zhou
2025-10-02
Data Structures and Algorithms · Computer Science
Better Bounds for Online Line Chasing
Marcin Bienkowski, Jarosław Byrka, Marek Chrobak, Christian Coester +2
2019-09-23
Data Structures and Algorithms · Computer Science
Competitive Analysis for Two Variants of Online Metric Matching Problem
Toshiya Itoh, Shuichi Miyazaki, Makoto Satake
2020-10-01
Data Structures and Algorithms · Computer Science
Optimal Online Bipartite Matching in Degree-2 Graphs
Amey Bhangale, Arghya Chakraborty, Prahladh Harsha
2025-11-21
Data Structures and Algorithms · Computer Science
Smoothed Analysis of Online Metric Matching with a Single Sample: Beyond Metric Distortion
Yingxi Li, Ellen Vitercik, Mingwei Yang
2026-04-22
Data Structures and Algorithms · Computer Science
The Power of Greedy for Online Minimum Cost Matching on the Line
Eric Balkanski, Yuri Faenza, Noemie Perivier
2025-03-28
Data Structures and Algorithms · Computer Science
Online Weighted Matching: Breaking the $\frac{1}{2}$ Barrier
Matthew Fahrbach, Morteza Zadimoghaddam
2019-11-22
Quantum Physics · Physics
Quantum Algorithms for Matching and Network Flows
Andris Ambainis, Robert Spalek
2007-05-23
Data Structures and Algorithms · Computer Science
Stochastic Online Metric Matching
Anupam Gupta, Guru Guruganesh, Binghui Peng, David Wajc
2019-04-22
Data Structures and Algorithms · Computer Science
Online Min-Max Paging
Ashish Chiplunkar, Monika Henzinger, Sagar Sudhir Kale, Maximilian Vötsch
2022-12-07