A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem

DOI10.1016/j.tcs.2006.01.047zbMath1099.68131OpenAlexW2048564690MaRDI QIDQ2503284

Yves F. Verhoeven

Publication date: 14 September 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.01.047

zbMATH Keywords

Markov chainsonline algorithmslower bounds

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The weighted 2-server problem
• The CNN problem and other \(k\)-server variants
• An Optimal On-Line Algorithm for K Servers on Trees
• New Ressults on Server Problems
• Competitive algorithms for server problems
• The generalized two-server problem
• On the k -server conjecture
• The harmonic k -server algorithm is competitive

This page was built for publication: A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem