Work

On the Advice Complexity of Online Matching on the Line

Year: 2024

Type: article

Abstract: 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

Source: Discrete Mathematics & Theoretical Computer Science

DOI: 10.46298/dmtcs.14125

Authors: Béla Csaba, Judit Nagy-György

Language: English

Topic: Optimization and Search Problems

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funders: Magyar Tudományos Akadémia, Nemzeti Kutatási, Fejlesztési és Innovaciós Alap

Awards: G2953162778, G298428782, G4614621299

OpenAlex ID: W4405106090

FWCI:

Cites:

Cited by:

Related to: 10