The 2-evader problem

DOI10.1016/0020-0190(96)00010-5MaRDI QIDQ1351604zbMATH OpenOpenAlexFDO

Authors Elias Koutsoupias, Christos Papadimitriou

Publication date 27 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(96)00010-5

zbMATH Keywords

analysis of algorithmson-line algorithmsserver problem

Mathematics Subject Classification ID

Positional games (pursuit and evasion, etc.) (91A24)

Recommendations

• On the k -server conjecture
• scientific article; zbMATH DE number 1528669
• scientific article; zbMATH DE number 1500547
• On the competitive ratio of the work function algorithm for the k-server problem

Cites work

• An Optimal On-Line Algorithm for K Servers on Trees
• Competitive algorithms for server problems
• scientific article; zbMATH DE number 65695 (Why is no real title available?)
• scientific article; zbMATH DE number 1256655 (Why is no real title available?)
• On the k-server conjecture

Cited in

(16)

• The \(k\)-resource problem in uniform metric spaces
• The 3-server problem in the plane.
• A randomized algorithm for two servers on the line.
• A general decomposition theorem for the k-server problem
• The weighted 2-server problem
• On the competitive ratio of the work function algorithm for the k-server problem
• The online \(k\)-server problem with max-distance objective
• A better lower bound on the competitive ratio of the randomized 2-server problem
• A fast work function algorithm for solving the k-server problem
• THE TWO GUARDS PROBLEM
• The \(k\)-server problem
• On the advice complexity of the \(k\)-server problem under sparse metrics
• Online facility assignment
• The k-Server Problem with Delays on the Uniform Metric Space
• Competitive Algorithms for Generalized k -Server in Uniform Metrics
• Towards the k-server conjecture: a unifying potential, pushing the frontier to the circle

This page was built for publication: The 2-evader problem

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