Online problems in facility location
We introduce two online models for the vertex k-center and the vertex k-median problems. Clients (i.e., graph vertices) and their corresponding links (i.e., graph edges) are revealed sequentially, determining the topology of a graph over time. Clients are revealed by an adversary to an online alg...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1993/8452 |