Distance and Centrality Concepts in Graphs
July 17 - 21, 2000
Chair: Peter Slater, University of Alabama - Huntsville, firstname.lastname@example.org
Many optimal facility location and design problems can be represented
as a problem of choosing an optimal set of some p >= 1 points in a graph.
For example, the p-center problem is to select p points such that the
maximum distance from a point in the graph to its nearest of the p points
is minimized. The p-median problem is to minimize the average distance to
the nearest of the p points. In addition to these emergency facilities and
service facilities problems, there are many other interesting central
location problems, such as competitive location theory problems.
For this week, we will investigate various graphical distance measures and central facility location problems.