K-server problem
= K-server problem
{wiki=K-server_problem}
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.