We are given a bipartite graph G(R, S, E) (|R| = |S|), where R denotes the set of requests and S being the set of servers. The requests R (given by an adversary) arrive sequentially along with their distances to each of ...