Unbounded lower bound for k-server against weak adversaries.
Marcin BienkowskiJaroslaw ByrkaChristian CoesterLukasz JezPublished in: CoRR (2019)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- objective function
- branch and bound
- optimal solution
- np hard
- worst case
- client server
- database
- lower bounding
- web server
- upper and lower bounds
- lagrangian relaxation
- central server
- low latency
- network bandwidth
- single server
- vc dimension
- lower and upper bounds
- linear programming relaxation
- steady state
- ip address
- data mining