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(n 2) time. In this paper, we improve it to O(nlog2 n).
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)
Benkoczi, R.: Cardinality constrained facility location problems in trees. Ph.D. thesis, School of Computing Science, Simon Fraser University, Canada (2004)
Benkoczi, R., Bhattacharya, B., Chrobak, M., Larmore, L.L., Rytter, W.: Faster Algorithms for k-Medians in Trees. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 218–227. Springer, Heidelberg (2003)
Bhattacharya, B., Kameda, T.: A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol. 7434, pp. 1–12. Springer, Heidelberg (2012)
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)
Chazelle, B., Guibas, L.J.: Fractional cascading: I. A data structuring technique. Algorithmica 1, 133–162 (1986)
Chen, B., Lin, C.S.: Minmax-regret robust 1-median location on a tree. Networks 31, 93–103 (1998)
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)
Tamir, A.: An O(pn 2) algorithm for the p-median and the related problems in tree graphs. Operations Research Letters 19, 59–64 (1996)
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., Song, Z. (2012). Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights. In: Chao, KM., Hsu, Ts., Lee, DT. (eds) Algorithms and Computation. ISAAC 2012. Lecture Notes in Computer Science, vol 7676. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35261-4_61
Download citation
DOI: https://doi.org/10.1007/978-3-642-35261-4_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35260-7
Online ISBN: 978-3-642-35261-4
eBook Packages: Computer ScienceComputer Science (R0)