Abstract
In a model of facility location problem, the uncertainty in the weight of a vertex is represented by an interval of weights, and minimizing the maximum “regret” is the goal. The most efficient previously known algorithm for finding the minmax regret 1-median on trees with positive vertex weights takes O(nlogn) time. We improve it to O(n), solving the open problem posed by Brodal et al. in [3].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Averbakh, I., Berman, O.: Minmax regret median location on a network under uncertainty. INFORMS Journal of Computing 12(2), 104–110 (2000)
Averbakh, I., Berman, O.: An improved algorithm for the minmax regret median problem on a tree. Networks 41, 97–103 (2003)
Brodal, G.S., Georgiadis, L., Katriel, I.: An O(n logn) version of the Averbakh–Berman algorithm for the robust median of a tree. Operations Research Letters 36, 14–18 (2008)
Burkard, R.E., Dollani, H.: Robust location problems with pos/neg-weights on a tree. Tech. Rep. Diskrete Optimierung Bericht Nr. 148, Karl-Franzens-Universiät Graz & Technische Universiät Graz (1999)
Burkard, R., Krarup, J.: A linear algorithm for the pos/neg-weighted 1-median problem on a cactus. Computing 60, 193–215 (1998)
Chen, B., Lin, C.S.: Minmax-regret robust 1-median location on a tree. Networks 31, 93–103 (1998)
Goldman, A.: Optimal center location in simple networks. Transportation Science 5, 212–221 (1971)
Hakimi, S.: Optimum locations of switching centers and the absolute centers and medians of a graph. Operations Research 12, 450–459 (1964)
Hale, T.S., Moberg, C.R.: Location science research: A review. Annals of Operations Research 123, 21–35 (2003)
Kariv, O., Hakimi, S.: An algorithmic approach to network location problems, part 2: The p-median. SIAM J. Appl. Math. 37, 539–560 (1979)
Kouvelis, P., Vairaktarakis, G., Yu, G.: Robust 1-median location on a tree in the presence of demand and transportation cost uncertainty. Tech. Rep. Working Paper 93/94-3-4, Department of Management Science. The University of Texas, Austin (1993)
Megiddo, N.: Linear-time algorithms for linear-programming in R 3 and related problems. SIAM J. Computing 12, 759–776 (1983)
Yu, H.I., Lin, T.C., Wang, B.F.: Improved algorithms for the minmax-regret 1-center and 1-median problem. ACM Transactions on Algorithms 4(3), 1–1 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhattacharya, B., Kameda, T. (2012). A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds) Computing and Combinatorics. COCOON 2012. Lecture Notes in Computer Science, vol 7434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32241-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-32241-9_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32240-2
Online ISBN: 978-3-642-32241-9
eBook Packages: Computer ScienceComputer Science (R0)