Abstract
Inverse 1-center problem on a network is to modify the edge lengths or vertex weights within certain bounds so that the prespecified vertex becomes an (absolute) 1-center of the perturbed network and the modifying cost is minimized. This paper focuses on the inverse 1-center problem on a weighted tree with uniform cost of edge length modification, a generalization for the analogous problem on an unweighted tree (Alizadeh and Burkard, Discrete Appl. Math. 159, 706–716, 2011). To solve this problem, we first deal with the weighted distance reduction problem on a weighted tree. Then, the weighted distances balancing problem on two rooted trees is introduced and efficiently solved. Combining these two problems, we derive a combinatorial algorithm with complexity of \(O(n^{2})\) to solve the inverse 1-center problem on a weighted tree if there exists no topology change during the edge length modification. Here, n is the number of vertices in the tree. Dropping this condition, the problem is solvable in \(O(n^{2}\mathbf {c})\) time, where \(\mathbf {c}\) is the compressed depth of the tree. Finally, some special cases of the problem with improved complexity, say linear time, are also discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alizadeh, B., Burkard, R.E.: Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees. Networks 58(3), 190–200 (2011)
Alizadeh, B., Burkard, R.E.: Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees. Discrete Appl. Math. 159(8), 706–716 (2011)
Alizadeh, B., Burkard, R.E., Pferschy, U.: Inverse 1-center location problems with edge length augmentation on trees. Computing 86(4), 331–343 (2009)
Balas, E., Zemel, E.: An algorithm for large zero-one knapsack problems. Oper. Res. 28(5), 1130–1154 (1980)
Baroughi Bonab, F., Burkard, R.E., Gassner, E.: Inverse p-median problems with variable edge lengths. Math. Methods Oper. Res. 73(2), 263–280 (2011)
Baroughi Bonab, F., Burkard, R.E., Alizadeh, B.: Inverse median location problems with variable coordinates. CEJOR Cent. Eur. J. Oper. Res. 18(3), 365–381 (2010)
Burkard, R.E., Pleschiutschnig, C., Zhang, J.: Inverse median problems. Discrete Optim. 1(1), 23–39 (2004)
Burkard, R.E., Pleschiutschnig, C., Zhang, J.: The inverse 1-median problem on a cycle. Discrete Optim. 5(2), 242–253 (2008)
Burkard, R.E., Galavii, M., Gassnner, E.: The inverse Fermat-Weber problem. European J. Oper. Res. 206(1), 11–17 (2010)
Cai, M.C., Yang, X.G., Zhang, J.Z.: The complexity analysis of inverse center location problem. J. Global Optim. 15(2), 213–218 (1999)
Drezner, Z., Hamacher, H.W.: Facility Location: Applications and Theory. Springer, Berlin (2002)
Eiselt, H.A., Marianov, V.: Foundations of location analysis. international series in operations research and management science. Springer, New York (2011)
Galavii, M.: The inverse 1-median problem on a tree and on a path. Electron. Notes Discrete Math. 36, 1241–1248 (2010)
Guan, X., Zhang, B.: Inverse 1-median problem on trees under weighted Hamming distance. J. Global Optim. 54(1), 75–82 (2012)
Hatzl, J., Karrenbauer, A.: A combinatorial algorithm for the 1-median problem in \(\mathbb {R}^{d}\) with the Chebyshev norm. Oper. Res. Lett. 38(5), 383–385 (2010)
Handler, G.Y.: Minimax location of a facility in an undirected tree graph. Transp. Sci. 7, 287–293 (1973)
Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. I: the p-centers. SIAM J. Appl. Math. 37(3), 513–538 (1979)
Love, R.F., Morris, J.G., Wesolowsky, G.O.: Facilities Location: Models and Methods. North-Holland (1988)
Megiddo, N.: Linear-time algorithms for linear programming in \(\mathbb {R}^{3}\) and related problems. SIAM J. Comput. 12(4), 759–776 (1983)
Nguyen, K.T.: Inverse 1-median problem on block graphs with variable vertex weights. J. Optim. Theory Appl. 68(3), 944–957 (2016)
Nguyen, K.T.: Reverse 1-center problem on weighted trees. Optimization 65(1), 253–264 (2016)
Nguyen, K.T., Anh, L.Q.: Inverse k-centrum problem on trees with variable vertex weights. Math. Methods Oper. Res. 82(1), 19–30 (2015)
Nguyen, K.T., Chassein, A.: Inverse eccentric vertex problem on networks. CEJOR Cent. Eur. J. Oper. Res. 23(3), 687–698 (2014)
Nguyen, K.T., Sepasian, A.R.: The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance. J. Comb. Optim. 32(3), 872–884 (2016)
Sepasian, A.R., Rahbarnia, F.: An \(O(n\log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions. Optimization 64(3), 595–602 (2013)
Acknowledgements
The authors would like to thank the anonymous referee and editor, whose valuable comments helped us to improve this paper.
Funding
This research is funded by Vietnam National Foundation for Science and Technology Development (NAFOSTED) under grant number 101.01-2016.08.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Nguyen, K.T., Nguyen-Thu, H. & Hung, N.T. Combinatorial Algorithms for the Uniform-Cost Inverse 1-Center Problem on Weighted Trees. Acta Math Vietnam 44, 813–831 (2019). https://doi.org/10.1007/s40306-018-0286-8
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40306-018-0286-8