scientific article; zbMATH DE number 2038743

MaRDI QIDQ4449208zbMATH OpenFDO

Authors Willem E. De Paepe, René A. Sitters, L. Stougie

Publication date 8 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2719/27190624.htm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Discrete location and assignment (90B80)

Recommendations

• A competitive 2-server algorithm
• Randomized competitive analysis for two server problems
• Randomized Competitive Analysis for Two-Server Problems
• Competitive algorithms for server problems
• The generalized two-server problem
• The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem
• Competitive k-server algorithms
• Competitive algorithms for the bicriteria \(k\)-server problem
• A better lower bound on the competitive ratio of the randomized 2-server problem
• Competitive algorithms for generalized k-server in uniform metrics

Cited in

(19)

• A competitive 2-server algorithm
• Competitive k-server algorithms
• Randomized competitive analysis for two server problems
• The weighted 2-server problem
• The CNN problem and other k-server variants
• Memoryless algorithms for the generalized k-server problem on uniform metrics
• The orthogonal CNN problem
• A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem
• On the continuous CNN problem
• scientific article; zbMATH DE number 4215366 (Why is no real title available?)
• The generalized two-server problem
• On fast algorithms for two servers
• scientific article; zbMATH DE number 1500545 (Why is no real title available?)
• The \(k\)-server problem
• scientific article; zbMATH DE number 742965 (Why is no real title available?)
• The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem
• Competitive Algorithms for Generalized k -Server in Uniform Metrics
• A randomized algorithm for two servers in cross polytope spaces
• Geometric two-server algorithms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449208)