Competitive analysis of k-server variants and metrical task systems
<p>In the online k-server problem, an algorithm controls k mobile servers in a metric space. One by one, requests arrive at points of the space, and the algorithm must serve each request by selecting a server to visit it. The goal is to minimize the total distance traveled by all servers. In t...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | Thesis |
| Idioma: | English |
| Publicado em: |
2019
|