Unbounded lower bound for k-server against weak adversaries.
Marcin BienkowskiJaroslaw ByrkaChristian CoesterLukasz JezPublished in: STOC (2020)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- web server
- client server
- lower and upper bounds
- np hard
- database
- objective function
- worst case
- upper and lower bounds
- optimal solution
- polynomial approximation
- central server
- client server architecture
- data sets
- competitive ratio
- lagrangian relaxation
- sample complexity