Zaferanieh, Mehdi; Fathali, Jafar - In: Computational Statistics 76 (2012) 2, pp. 147-160
Let T = (V, E) be a tree. A core of T is a path P, for which the sum of the weighted distances from all vertices to this path is minimized. In this paper, we consider the semi-obnoxious case in which the vertices have positive or negative weights. We prove that, when the sum of the weights of...