Abstract
In a facility location problem, if the vertex weights are uncertain one may look for a "robust" solution that minimizes "regret." The most efficient previously known algorithm for finding the minmax regret 1-median on trees with positive and negative vertex weights takes O(n2) time. In this paper, we improve it to O(n log2 n). © Springer-Verlag Berlin Heidelberg 2012.
Cite
CITATION STYLE
Bhattacharya, B., Kameda, T., & Song, Z. (2012). Computing minmax regret 1-median on a tree network with positive/negative vertex weights. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7676 LNCS, pp. 588–597). Springer Verlag. https://doi.org/10.1007/978-3-642-35261-4_61
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
