Abstract
Recently, Cheng et al. [1] proposed the minimax regret 1-sink location problem in dynamic path networks and presented an O(nlog2 n) time algorithm for the proposed problem, where n is the number of vertices. In this paper, we study the general problem, i.e., minimax regret k-sink location problem in the dynamic path networks. Based on the algorithm for the 1-sink location problem, we design an \(O(n^2(\log n)^{1+\log k}C_n^{k-1})\) time algorithm for the general problem, where \(C_n^{k-1}\) is the number of combination choosing k − 1 from n.
This work was supported by China Postdoctoral Science Foundation under Grant 2013M530404, NSF of China under Grants 71371129, 71071123 and 61221063 and Program for Changjiang Scholars and Innovative Research Team in University under Grant IRT1173.
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.
Similar content being viewed by others
References
Cheng, S.-W., Higashikawa, Y., Katoh, N., Ni, G., Su, B., Xu, Y.: Minimax regret 1-sink location problems in dynamic path networks. In: Chan, T.-H.H., Lau, L.C., Trevisan, L. (eds.) TAMC 2013. LNCS, vol. 7876, pp. 121–132. Springer, Heidelberg (2013)
Y. Higashikawa, J. Augustine, S.W. Cheng, G.J. Golin, N. Katoh, G. Ni, B. Su, and Y. Xu, Minimax regret 1-sink location problems in dynamic path networks. Theoretical Computer Science (to appear, 2014)
Higashikawa, Y., Golin, M.J., Katoh, N.: Minimax regret sink location problems in dynamic tree networks with uniform capacity. In: Pal, S.P., Sadakane, K. (eds.) WALCOM 2014. LNCS, vol. 8344, pp. 125–137. Springer, Heidelberg (2014)
Li, H., Xu, Y., Ni, G.: Minimax regret 2-sink location problem in dynamic path networks. Journal of Combinatorial Optimization (to appear, 2014)
Mamada, S., Uno, T., Makino, K., Fujishige, S.: An O(n log2 n) algorithm for the optimal sink location problem in dynamic tree networks. Discrete Applied Mathematics 154, 2387–2401 (2006)
Wang, H.: Minimax regret 1-facility location on uncertain path networks. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) ISAAC 2013. LNCS, vol. 8283, pp. 733–743. Springer, Heidelberg (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Ni, G., Xu, Y., Dong, Y. (2014). Minimax Regret k-sink Location Problem in Dynamic Path Networks. In: Gu, Q., Hell, P., Yang, B. (eds) Algorithmic Aspects in Information and Management. AAIM 2014. Lecture Notes in Computer Science, vol 8546. Springer, Cham. https://doi.org/10.1007/978-3-319-07956-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-07956-1_3
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07955-4
Online ISBN: 978-3-319-07956-1
eBook Packages: Computer ScienceComputer Science (R0)