On the Advice Complexity of Online Matching on the Line
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<k<n$ we present a $c(n/k)$-competit...
Saved in:
| Published in: | Discrete mathematics and theoretical computer science Vol. 26:3; no. Discrete Algorithms |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
01.01.2024
|
| Subjects: | |
| ISSN: | 1365-8050, 1365-8050 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!