LOCATION LOGISTICS
Dr. Gary M. Gaukler
Homework Assignment #4
Due next Tuesday
1. Consider the weighted tree given by Problem 7.2 on p. 450. Solve the 1-center problem for this tree.
2. Discuss whether in the 1-center problem on a weighted tree, the nodes s and t that are identified in
the algorithm, need to be leaf nodes, or if they can be any kind of node. Give an example.
3. Consider the covering problem of Figure 7.4 on p. 413. Reduce the length of string number 5 to 7
and solve the resulting covering problem. Do we need more centers now?