Empirical Analysis of Algorithms for the k-Server and Online Bipartite Matching Problems
The k–server problem is of significant importance to the theoretical computer science and the operations research community. In this problem, we are given k servers, their initial locations and a sequence of n requests that arrive one at a time. All these locations are points from some metric space...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
Virginia Tech
2020
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10919/96725 |