2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2013★ 2 cited
A Competitive Ratio Approximation Scheme for the k-Server Problem in Fixed Finite Metrics
Tobias Mömke
We show how to restrict the analysis of a class of online problems that includes the -server problem in finite metrics such that we only have to consider finite sequences of req…
cs.DS2013
Randomized online computation with high probability guarantees
Dennis Komm, Rastislav Královič, Richard Královič +1
We study the relationship between the competitive ratio and the tail distribution of randomized online minimization problems. To this end, we define a broad class of online problem…