A decomposition theorem and bounds for randomized server problems

Avrim Blum; Howard Karloff; Yuval Rabani; Michael Saks

doi:10.1109/SFCS.1992.267772

A decomposition theorem and bounds for randomized server problems

Avrim Blum, Howard Karloff, Yuval Rabani, Michael Saks

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

25 Scopus citations

Abstract

The authors prove a lower bound of Omega ( square root logk/loglogk) for the competitive ratio of randomized algorithms for the k-server problem against an oblivious adversary. The bound holds for arbitrary metric spaces (of at least k+1 points) and provides a new lower bound for the metrical task system problem as well. This improves the previous best lower bound of Omega (loglogk) for arbitrary metric spaces, more closely approaching the conjectured lower bound of Omega (logk). They also prove a lower bound of Omega (^logk/_loglogk) for the server problem on k+1 equally-spaced points on a line, which corresponds to some natural motion-planning problems.

Original language	English
Title of host publication	Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
Publisher	IEEE Computer Society
Pages	197-207
Number of pages	11
ISBN (Electronic)	0818629002
DOIs	https://doi.org/10.1109/SFCS.1992.267772
State	Published - 1992
Externally published	Yes
Event	33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 - Pittsburgh, United States Duration: 24 Oct 1992 → 27 Oct 1992

Publication series

Name	Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Volume	1992-October
ISSN (Print)	0272-5428

Conference

Conference	33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
Country/Territory	United States
City	Pittsburgh
Period	24/10/92 → 27/10/92

Bibliographical note

Publisher Copyright:
© 1992 IEEE.

Access to Document

10.1109/SFCS.1992.267772

Cite this

Blum, A., Karloff, H., Rabani, Y., & Saks, M. (1992). A decomposition theorem and bounds for randomized server problems. In Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 (pp. 197-207). Article 267772 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; Vol. 1992-October). IEEE Computer Society. https://doi.org/10.1109/SFCS.1992.267772

@inproceedings{24c5b8b9b90e445abfec3c1e650c127e,

title = "A decomposition theorem and bounds for randomized server problems",

abstract = "The authors prove a lower bound of Omega ( square root logk/loglogk) for the competitive ratio of randomized algorithms for the k-server problem against an oblivious adversary. The bound holds for arbitrary metric spaces (of at least k+1 points) and provides a new lower bound for the metrical task system problem as well. This improves the previous best lower bound of Omega (loglogk) for arbitrary metric spaces, more closely approaching the conjectured lower bound of Omega (logk). They also prove a lower bound of Omega (logk/loglogk) for the server problem on k+1 equally-spaced points on a line, which corresponds to some natural motion-planning problems.",

author = "Avrim Blum and Howard Karloff and Yuval Rabani and Michael Saks",

note = "Publisher Copyright: {\textcopyright} 1992 IEEE.; 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 ; Conference date: 24-10-1992 Through 27-10-1992",

year = "1992",

doi = "10.1109/SFCS.1992.267772",

language = "אנגלית",

series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

publisher = "IEEE Computer Society",

pages = "197--207",

booktitle = "Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992",

address = "ארצות הברית",

}

Blum, A, Karloff, H, Rabani, Y & Saks, M 1992, A decomposition theorem and bounds for randomized server problems. in Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992., 267772, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, vol. 1992-October, IEEE Computer Society, pp. 197-207, 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992, Pittsburgh, United States, 24/10/92. https://doi.org/10.1109/SFCS.1992.267772

A decomposition theorem and bounds for randomized server problems. / Blum, Avrim; Karloff, Howard; Rabani, Yuval et al.
Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, 1992. p. 197-207 267772 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; Vol. 1992-October).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A decomposition theorem and bounds for randomized server problems

AU - Blum, Avrim

AU - Karloff, Howard

AU - Rabani, Yuval

AU - Saks, Michael

PY - 1992

Y1 - 1992

N2 - The authors prove a lower bound of Omega ( square root logk/loglogk) for the competitive ratio of randomized algorithms for the k-server problem against an oblivious adversary. The bound holds for arbitrary metric spaces (of at least k+1 points) and provides a new lower bound for the metrical task system problem as well. This improves the previous best lower bound of Omega (loglogk) for arbitrary metric spaces, more closely approaching the conjectured lower bound of Omega (logk). They also prove a lower bound of Omega (logk/loglogk) for the server problem on k+1 equally-spaced points on a line, which corresponds to some natural motion-planning problems.

AB - The authors prove a lower bound of Omega ( square root logk/loglogk) for the competitive ratio of randomized algorithms for the k-server problem against an oblivious adversary. The bound holds for arbitrary metric spaces (of at least k+1 points) and provides a new lower bound for the metrical task system problem as well. This improves the previous best lower bound of Omega (loglogk) for arbitrary metric spaces, more closely approaching the conjectured lower bound of Omega (logk). They also prove a lower bound of Omega (logk/loglogk) for the server problem on k+1 equally-spaced points on a line, which corresponds to some natural motion-planning problems.

UR - http://www.scopus.com/inward/record.url?scp=84976849443&partnerID=8YFLogxK

U2 - 10.1109/SFCS.1992.267772

DO - 10.1109/SFCS.1992.267772

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84976849443

T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

SP - 197

EP - 207

BT - Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992

PB - IEEE Computer Society

T2 - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992

Y2 - 24 October 1992 through 27 October 1992

ER -

A decomposition theorem and bounds for randomized server problems

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this