Skip to main navigation
Skip to search
Skip to main content
The Hebrew University of Jerusalem Home
Approve / Request updates on publications
Home
Profiles
Research units
Research output
Prizes
Search by expertise, name or affiliation
Randomized k-server algorithms for growth-rate bounded graphs
Yair Bartal
, Manor Mendel
*
*
Corresponding author for this work
The Rachel and Selim Benin School of Engineering and Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
5
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Randomized k-server algorithms for growth-rate bounded graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Approximation Techniques
33%
Competitive Ratio
100%
Growth Rate
100%
K-server
100%
K-server Problem
33%
Metric Approximation Property
33%
Metric Space
100%
Mobile Server
33%
Movement Cost
33%
Natural Class
33%
Online Problem
33%
Probabilistic Metric
33%
Mathematics
Approximation Technique
33%
Competitive Ratio
100%
Metric Space
100%
Minimizes
33%
Probabilistic Metric
33%
Wide Range
33%
Computer Science
Approximation Technique
33%
Competitive Ratio
100%
Metric Space
100%