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...
Uloženo v:
| Vydáno v: | Discrete mathematics and theoretical computer science Ročník 26:3; číslo Discrete Algorithms |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Discrete Mathematics & Theoretical Computer Science
01.01.2024
|
| Témata: | |
| ISSN: | 1365-8050, 1365-8050 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | 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. |
|---|---|
| ISSN: | 1365-8050 1365-8050 |
| DOI: | 10.46298/dmtcs.14125 |