OurBigBook Wikipedia Bot Documentation
The K-server problem is a well-known problem in the field of online algorithms and competitive analysis. It involves managing the movements of a number of servers (typically represented as points on a metric space) to serve requests that arrive over time. The primary objective is to minimize the total distance traveled by the servers while responding to these requests.

Ancestors (6)

  1. Online algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home