Recently, the inverse connected p-median problem on block graphs G(V,E,w) under various cost functions, say rectilinear norm, Chebyshev norm, and bottleneck Hamming distance. Their contributions include finding a necessary and sufficient condition for the connected p-median problem on block graphs, developing algorithms and showing that these problems can be solved in O(n？log？n) time, where n is the number of vertices in the underlying block graph. Using similar technique, we show that some results are incorrect by a counter-example. Then we redefine some notations, reprove Theorem 1 and redescribe Theorem 2, Theorem 3 and Theorem 4.
References
[1]
Yen, C. (2012) The Connected p-Center Problem on Block Graphs with Forbidden Vertices. Theoretical Computer Science, 426-427, 13-24. https://doi.org/10.1016/j.tcs.2011.12.013
[2]
Bai, C., Zhou, J. and Liang, Z. (2021) The Connected p-Median Problem on Cactus Graphs. Computational Intelligence and Neuroscience, 2021, 1-9. https://doi.org/10.1155/2021/3533623
[3]
Kang, L., Zhou, J. and Shan, E. (2018) Algorithms for Connected p-Centdian Problem on Block Graphs. Journal of Combinatorial Optimization, 36, 252-263. https://doi.org/10.1007/s10878-016-0058-0
[4]
Nguyen, K.T. and Hung, N.T. (2020) The Inverse Connected p-Median Problem on Block Graphs under Various Cost Functions. Annals of Operations Research, 292, 97-112. https://doi.org/10.1007/s10479-020-03651-3
