Tight bounds for double coverage against weak adversaries

DOI10.1007/s00224-016-9703-3zbMath1390.68767DBLPjournals/mst/BansalEJKP18OpenAlexW3040305025WikidataQ59473755 ScholiaQ59473755MaRDI QIDQ1743121

Nikhil Bansal, Grigorios Koumoutsos, Łukasz Jeż, Marek Eliáš, Kirk R. Pruhs

Publication date: 12 April 2018

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-016-9703-3

zbMATH Keywords

resource augmentation\(k\)-serverdouble coverageweak adversaries

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)

Related Items (2)

Reallocating multiple facilities on the line ⋮ Dynamic pricing of servers on trees

Cites Work

• Unnamed Item
• Unnamed Item
• On-line file caching
• On the competitive ratio of the work function algorithm for the \(k\)-server problem
• An Optimal On-Line Algorithm for K Servers on Trees
• New Ressults on Server Problems
• Competitive algorithms for server problems
• On the k -server conjecture

This page was built for publication: Tight bounds for double coverage against weak adversaries