'Rightmost server' presentation slideshows

Exercise 10.10

Exercise 10.10. Prove that the k-server WFA algorithm is k-competitive when the metric space is a real line segment. Solution: All initial points and requests are on the line segment pq. To prove k-competitive, we need to prove that Total extended cost <= (k+1)OPT + const; OPT = w f (C f ).

146 views • 8 slides