Answers are grounded in this paper and cite their sources.
This paper considers the problem of locating p facilities on a tree network in order to minimize the maximum of the distances of the points on the network to their respective nearest facilities. An O ( ( nlog p )² ) algorithm for a tree network with n nodes is presented.
No takes yet. Share an insight, caveat, or question.
Chandrasekaran et al. (1980) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: