Béla Csaba ; Judit Nagy-György - On the Advice Complexity of Online Matching on the Line

dmtcs:14125 - Discrete Mathematics & Theoretical Computer Science, December 6, 2024, vol. 26:3 - https://doi.org/10.46298/dmtcs.14125
On the Advice Complexity of Online Matching on the LineArticle

Authors: 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 n1, and show that there is no 1-competitive online algorithm reading less than n1 bits of advice. Moreover, for each 0<k<n we present a c(n/k)-competitive online algorithm with advice complexity O(k(logN+logn)) where n is the number of servers, N is the distance of the minimal and maximal servers, and c(n) is the complexity of the best online algorithm without advice.


    Volume: vol. 26:3
    Section: Discrete Algorithms
    Published on: December 6, 2024
    Accepted on: November 18, 2024
    Submitted on: August 28, 2024
    Keywords: Computer Science - Data Structures and Algorithms

    Consultation statistics

    This page has been seen 176 times.
    This article's PDF has been downloaded 106 times.