A note on the robust 1-center problem on trees

We consider the robust 1-center problem on trees with uncertainty in vertex weights and edge lengths. The weights of the vertices and the lengths of the edges can take any value in prespecified intervals with unknown distribution. We show that this problem can be solved in O(n³ log n) time thus improving on Averbakh and Berman's algorithm with time complexity O(n⁶). For the case when the vertices of the tree have weights equal to 1 we show that the robust 1-center problem can be solved in O(n log n) time, again improving an Averbakh and Berman's time complexity of O(n² log n).