Note on the work function algorithm
We prove that the work function algorithm is (n-l)-competitive for the k-server problem, where n is the number of points in the metric space. This gives improved upper bounds when k +3 < n < 2k-1; in particular, it shows that the work function algorithm is optimal for k = n-1. Recently this re...
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2000
|
| Sorozat: | Acta cybernetica
14 No. 3 |
| Kulcsszavak: | Számítástechnika, Kibernetika, Algoritmus |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12644 |
| LEADER | 01077nab a2200217 i 4500 | ||
|---|---|---|---|
| 001 | acta12644 | ||
| 005 | 20220614103937.0 | ||
| 008 | 161015s2000 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Csaba Béla | |
| 245 | 1 | 0 | |a Note on the work function algorithm |h [elektronikus dokumentum] / |c Csaba Béla |
| 260 | |c 2000 | ||
| 300 | |a 503-506 | ||
| 490 | 0 | |a Acta cybernetica |v 14 No. 3 | |
| 520 | 3 | |a We prove that the work function algorithm is (n-l)-competitive for the k-server problem, where n is the number of points in the metric space. This gives improved upper bounds when k +3 < n < 2k-1; in particular, it shows that the work function algorithm is optimal for k = n-1. Recently this result was proved independently by Koutsoupias in [K]. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika, Algoritmus | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12644/1/cybernetica_014_numb_003_503-506.pdf |z Dokumentum-elérés |