Geometric two-server algorithms
type: Item
instance of: scholarly article
title: Geometric two-server algorithms
zbMATH Open document ID: 0875.68530
DOI: 10.1016/0020-0190(94)00223-L
author: Ran El-Yaniv
author: Jon M. Kleinberg
published in: Information Processing Letters
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 985833
zbMATH Keywords: Analysis of algorithms
zbMATH Keywords: On-line algorithms
MaRDI profile type: Publication
cites work: New Ressults on Server Problems
cites work: A New Approach to the Server Problem
cites work: On fast algorithms for two servers
cites work: An Optimal On-Line Algorithm for K Servers on Trees
cites work: Random walks on weighted graphs and applications to on-line algorithms
cites work: A competitive 2-server algorithm
cites work: Competitive algorithms for server problems
Wikidata QID: Q126464705
full work available at URL: 0020-0190(94)00223-l
OpenAlex ID: W2087364848
description: scientific article; zbMATH DE number 985833