A general decomposition theorem for the \(k\)-server problem
type: Item
instance of: scholarly article
title: A general decomposition theorem for the \(k\)-server problem
zbMATH Open document ID: 1009.68005
author: Steven S. Seiden
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68U35
zbMATH DE Number: 1853257
MaRDI profile type: Publication
full work available at URL: inco.2002.3144
OpenAlex ID: W2013255427
cites work: Q4542533
cites work: Q4527040
cites work: A randomized algorithm for two servers on the line.
cites work: On the power of randomization in on-line algorithms
cites work: A decomposition theorem for task systems and bounds for randomized server problems
cites work: Q4223058
cites work: An optimal on-line algorithm for metrical task system
cites work: New Ressults on Server Problems
cites work: An Optimal On-Line Algorithm for K Servers on Trees
cites work: Q4010306
cites work: A better lower bound on the competitive ratio of the randomized 2-server problem
cites work: Competitive paging algorithms
cites work: Better algorithms for unfair metrical task systems and applications
cites work: Online algorithms. The state of the art
cites work: Randomized weighted caching with two page weights
cites work: Competitive randomized algorithms for nonuniform problems
cites work: Lower Bounds for Randomized k-Server and Motion-Planning Algorithms
cites work: On the k -server conjecture
cites work: The 2-evader problem
cites work: Competitive algorithms for server problems
cites work: A strongly competitive randomized paging algorithm
cites work: Unfair problems and randomized algorithms for metrical task systems
DOI: 10.1006/INCO.2002.3144
description: scientific article; zbMATH DE number 1853257