The location of central structures in trees (Q1097827)

A nonlinear version of the path center location problem is analyzed. We introduce a closely related problem called the subtree location problem. Variants in which the endpoints of the central structure to be located may or may not be restricted to the vertex set are also studied. We give theoretical results for the nonlinear cases when the underlying structure is a tree with edges of varying length and linear time algorithms for the unweighted vertex case. The linear time algorithms have their basis in an efficient data structure for representing trees.