Skip to main navigation
Skip to search
Skip to main content
Utrecht University Home
Help & FAQ
Link opens in a new tab
Search content at Utrecht University
Home
People
Research units
Research output
Activities
In the media
Prizes & Grants
Competitive Algorithms for Generalized k-Server in Uniform Metrics
Nikhil Bansal
, Marek Elias
, Grigorios Koumoutsos
,
Jesper Nederlof
Sub Algorithms and Complexity
Algorithms and Complexity
Research output
:
Working paper
›
Preprint
›
Academic
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Competitive Algorithms for Generalized k-Server in Uniform Metrics'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Competitive Algorithm
100%
K-server
100%
Uniform Metric
100%
Deterministic Algorithm
50%
K-server Problem
50%
Randomized Algorithms
25%
Distance Traveled
25%
Online Algorithms
25%
Competitive Ratio
25%
Polynomial Method
25%
Metric Space
25%
Exponential Lower Bounds
25%
Doubly Exponential
25%
Uniform Lines
25%
Total Distance
25%
K-tuple
25%
Deterministic Bounds
25%
Computer Science
Randomized Algorithm
100%
Total Distance
100%
Deterministic Bound
100%
on-line algorithm
100%
Competitive Ratio
100%
Metric Space
100%
Mathematics
Minimizes
100%
Metric Space
100%
Competitive Ratio
100%
Polynomials Method
100%