A Note on the Robust 1-Center Problem on Trees
- 86 Downloads
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(n3 log n) time thus improving on Averbakh and Berman's algorithm with time complexity O(n6). 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(nlog n) time, again improving on Averbakh and Berman's time complexity of O(n2 log n).
Unable to display preview. Download preview PDF.
- I. Averbakh and O. Berman, Algorithms for the robust 1-center problem on a tree, European Journal of Operational Research 123 (2000) 292-302.Google Scholar
- G.N. Frederickson, Parametric search and locating supply centers in trees, in: Algorithms and Data Structures (Ottawa, ON, 1991), Lecture Notes in Computer Science 519 (Springer, Berlin, 1991) pp. 299-319.Google Scholar
- G.Y. Handler, Minimax location of a facility in an undirected graph, Transportation Science 7 (1973) 287-293.Google Scholar
- N. Megiddo, Linear time algorithms for linear programming in ℝ3 and related problems, SIAM J. Comput. 12 (1983) 759-776.Google Scholar
- M. Sharir and P.K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications (Cambridge Univ. Press, New York, 1995).Google Scholar