Efficient algorithms for finding a core of a tree with a specified length
Journal of Algorithms
Algorithms for path medi-centers of a tree
Computers and Operations Research - location science
An O(pn2) algorithm for the p -median and related problems on tree graphs
Operations Research Letters
| Hi-index | 0.00 |
In a network, the distsum of a path is the sum of the distances of all vertices to the path, and the ECCENTRICITY is the maximum distance of any vertex to the path. The Cent-dian problem is the constrained optimization problem which seeks to locate on a network a path which has minimalv alue of the distsum over all paths whose ECCENTRICITY is bounded by a fixed constant. We consider this problem for trees, and we also consider the problem where an additional constraint is required, namely that the optimal path has LENGTH bounded by a fixed constant. The first problem has already been considered in the literature. We give another linear time algorithm for this problem which is considerably simpler than the previous one. The second problem does not seem to have been considered elsewhere, and we give an O(n log2 n) divide-and-conquer algorithm for its solution.