Uniform service systems with k servers
We consider the problem of k servers situated on a uniform metric space that must serve a sequence of requests, where each request consists of a set of locations of the metric space and can be served by moving a server to any of the nodes of the set. The goal is to minimize the total distance travel...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | SER |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_03029743_v1380_n_p23_Feuerstein |
| Aporte de: |
| id |
todo:paper_03029743_v1380_n_p23_Feuerstein |
|---|---|
| record_format |
dspace |
| spelling |
todo:paper_03029743_v1380_n_p23_Feuerstein2023-10-03T15:18:50Z Uniform service systems with k servers Feuerstein, E. Lucchesi C.L. Moura A.V. Set theory Topology Competitive ratio K-server Lower and upper bounds Metric spaces On-line algorithms Service systems Total distances Uniform metric Information science We consider the problem of k servers situated on a uniform metric space that must serve a sequence of requests, where each request consists of a set of locations of the metric space and can be served by moving a server to any of the nodes of the set. The goal is to minimize the total distance traveled by the servers. This problem generalizes a problem presented by Chrobak and Larmore in [7]. We give lower and upper bounds on the competitive ratio achievable by on-line algorithms for this problem, and consider also interesting particular cases. © Springer-Verlag Berlin Heidelberg 1998. SER info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_03029743_v1380_n_p23_Feuerstein |
| institution |
Universidad de Buenos Aires |
| institution_str |
I-28 |
| repository_str |
R-134 |
| collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
| topic |
Set theory Topology Competitive ratio K-server Lower and upper bounds Metric spaces On-line algorithms Service systems Total distances Uniform metric Information science |
| spellingShingle |
Set theory Topology Competitive ratio K-server Lower and upper bounds Metric spaces On-line algorithms Service systems Total distances Uniform metric Information science Feuerstein, E. Lucchesi C.L. Moura A.V. Uniform service systems with k servers |
| topic_facet |
Set theory Topology Competitive ratio K-server Lower and upper bounds Metric spaces On-line algorithms Service systems Total distances Uniform metric Information science |
| description |
We consider the problem of k servers situated on a uniform metric space that must serve a sequence of requests, where each request consists of a set of locations of the metric space and can be served by moving a server to any of the nodes of the set. The goal is to minimize the total distance traveled by the servers. This problem generalizes a problem presented by Chrobak and Larmore in [7]. We give lower and upper bounds on the competitive ratio achievable by on-line algorithms for this problem, and consider also interesting particular cases. © Springer-Verlag Berlin Heidelberg 1998. |
| format |
SER |
| author |
Feuerstein, E. Lucchesi C.L. Moura A.V. |
| author_facet |
Feuerstein, E. Lucchesi C.L. Moura A.V. |
| author_sort |
Feuerstein, E. |
| title |
Uniform service systems with k servers |
| title_short |
Uniform service systems with k servers |
| title_full |
Uniform service systems with k servers |
| title_fullStr |
Uniform service systems with k servers |
| title_full_unstemmed |
Uniform service systems with k servers |
| title_sort |
uniform service systems with k servers |
| url |
http://hdl.handle.net/20.500.12110/paper_03029743_v1380_n_p23_Feuerstein |
| work_keys_str_mv |
AT feuersteine uniformservicesystemswithkservers AT lucchesicl uniformservicesystemswithkservers AT mouraav uniformservicesystemswithkservers |
| _version_ |
1807321352811577344 |