The Connected p-Center Problem with Extension


Let G(V, E, W) be a graph n vertices and m edges, where each edge e is associated with a positive distance W(e). The traditional p-Center problem is to locate some kind of facilities at p vertices of G to minimize the maximum distance between any vertex and its nearest facility. This paper proposes a practical constraint: the subgraph induced by the p… (More)
DOI: 10.2991/jcis.2006.216

2 Figures and Tables


  • Presentations referencing similar topics