Uniform service systems with k servers

Mostrar todas las versiones(2)

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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Feuerstein, E., Lucchesi C.L., Moura A.V.
Formato: SER
Materias:
Set theory
Topology
Competitive ratio
K-server
Lower and upper bounds
Metric spaces
On-line algorithms
Service systems
Total distances
Uniform metric
Information science
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_03029743_v1380_n_p23_Feuerstein
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares