This paper treats a topic in “obnoxious facility location,” namely the problem of locating a single facility in an n-vertex tree network so as to maximize the sum of its weighted distances from the vertices. It is shown that use of a suitable data structure permits a solution algorithm with computational effort O(n), an improvement over the O(n 2 ) required by a previously indicated procedure.
No takes yet. Share an insight, caveat, or question.
A 1984 study studied this question.