Tight bounds for double coverage against weak adversaries

Recommendations

Tight Bounds for Double Coverage Against Weak Adversaries
Tight approximation bounds for maximum multi-coverage
Tight approximation bounds for maximum multi-coverage
Unbounded lower bound for k-server against weak adversaries
Tight bounds on the round complexity of the distributed maximum coverage problem
Tight approximation bounds for combinatorial frugal coverage algorithms
Tight approximation bounds for greedy frugal coverage algorithms
Lower bounds for restricted schemes in the two-adaptive bitprobe model
A Tight Bound for Stochastic Submodular Cover
A class of problems where dual bounds beat underestimation bounds

Cites work

scientific article; zbMATH DE number 65695 (Why is no real title available?)
scientific article; zbMATH DE number 1232130 (Why is no real title available?)
An Optimal On-Line Algorithm for K Servers on Trees
Competitive algorithms for server problems
New Ressults on Server Problems
On the k -server conjecture
On the competitive ratio of the work function algorithm for the k-server problem
On-line file caching

Cited in

(5)

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