Friday, 16:15 - 16:40 h, Room: H 3010

 

Rene Sitters
Metrical service systems and the generalized work function algorithm

 

Abstract:
There are some very intriguing open problems in online optimization. Examples are the k-server conjecture (deterministic and randomized) and the dynamic search tree conjecture (dynamic optimality conjecture). Both problems are in the class of metrical service systems (online shortest path problems). It is widely believed that dynamic search trees are constant competitive. We show some strong techniques for proving constant competitiveness of metrical service systems and develop a universal theory of competitive analysis of metrical service systems. In particular, we apply this to the generalized 2-server problem and show that the generalized work function algorithm is onstant competitive in any metric space, as was conjectured by Koutsoupias and Taylor (2004).

 

Talk 3 of the invited session Fri.3.H 3010
"Routing and shortest paths" [...]
Cluster 1
"Approximation & online algorithms" [...]

 

  Payday Loans In Missouri. What can cause long-term use of Viagra? In the network and other sources of information, there is no reliable data on the long-term use of Viagra and its negative effects on the body.