On the Advice Complexity of Online Matching on the Line

Béla Csaba, Judit Nagy-György

We consider the matching problem on the line with advice complexity. We give a 1-competitive online algorithm with advice complexity $n-1,$ and show that there is no 1-competitive…