On the Advice Complexity of Online Matching on the Line
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917864683864064 |
|---|---|
| author | Csaba, Béla Nagy-György, Judit |
| author_facet | Csaba, Béla Nagy-György, Judit |
| contents | 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)$-competitive online algorithm with advice complexity $O(k(\log N + \log n))$ 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_11161 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the Advice Complexity of Online Matching on the Line Csaba, Béla Nagy-György, Judit Data Structures and Algorithms 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)$-competitive online algorithm with advice complexity $O(k(\log N + \log n))$ 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. |
| title | On the Advice Complexity of Online Matching on the Line |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2408.11161 |