Abstract: The classic p -center problem consists of choosing a set of p vertices in an undirected graph as facilities in order to minimize the maximum distance between each client vertex and its ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results