The 2-evader problem

DOI10.1016/0020-0190(96)00010-5zbMath0868.90150OpenAlexW1979856149MaRDI QIDQ1351604

Elias Koutsoupias, Christos H. 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)

Related Items (14)

A better lower bound on the competitive ratio of the randomized 2-server problem ⋮ The weighted 2-server problem ⋮ On the competitive ratio of the work function algorithm for the \(k\)-server problem ⋮ A fast work function algorithm for solving the \(k\)-server problem ⋮ Competitive Algorithms for Generalized k -Server in Uniform Metrics ⋮ The \(k\)-server problem ⋮ On the advice complexity of the \(k\)-server problem under sparse metrics ⋮ The k-Server Problem with Delays on the Uniform Metric Space ⋮ The \(k\)-resource problem in uniform metric spaces ⋮ Online facility assignment ⋮ 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 online \(k\)-server problem with max-distance objective

Cites Work

• On the k-server conjecture
• An Optimal On-Line Algorithm for K Servers on Trees
• Competitive algorithms for server problems
• Unnamed Item
• Unnamed Item

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