Csaba Béla: Note on the work function algorithm. In: Acta cybernetica, (14) 3. pp. 503-506. (2000)
Preview |
Cikk, tanulmány, mű
cybernetica_014_numb_003_503-506.pdf Download (549kB) | Preview |
Abstract
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].
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 2000 |
| Volume: | 14 |
| Number: | 3 |
| ISSN: | 0324-721X |
| Page Range: | pp. 503-506 |
| Language: | English |
| Place of Publication: | Szeged |
| Related URLs: | http://acta.bibl.u-szeged.hu/38509/ |
| Uncontrolled Keywords: | Számítástechnika, Kibernetika, Algoritmus |
| Additional Information: | Bibliogr.: p. 505-506. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2016. Oct. 15. 12:25 |
| Last Modified: | 2022. Jun. 14. 10:39 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/12644 |
Actions (login required)
 |
View Item |
