This paper studies the problem of finding the 1-median on a graph where vertex weights are uncertain and the uncertainty is characterized by given intervals. It is required to find a minmax regret solution, which minimizes the worst-case loss in the objective function. Averbakh and Berman had an O(mn 2 log n)-time algorithm for the problem on a general graph, and had an O(nlog2 n)-time algorithm on a tree. In this paper, we improve these two bounds to O(mn2 +n3log n) and O(nlog n), respectively. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Yu, H. I., Lin, T. C., & Wang, B. F. (2006). Improved algorithms for the minmax regret 1-median problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4112 LNCS, pp. 52–62). Springer Verlag. https://doi.org/10.1007/11809678_8
Mendeley helps you to discover research relevant for your work.