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 $n-1,$ and show that there is no 1-competitive online algorithm reading less than $n-1$ bits of advice. Moreover, for each $0

    https://doi.org/10.46298/dmtcs.14125
    Source: arXiv.org:2408.11161
    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
    Licence: Attribution 4.0 International (CC BY 4.0)

    Share and export

    Consultation statistics

    This page has been seen 415 times.
    This article's PDF has been downloaded 329 times.