A Note on the Inverse Connected p-Median Problem on Block Graphs  

作　　者：Chunsong Bai Liqi Zhang Jianjie Zhou Chunsong Bai;Liqi Zhang;Jianjie Zhou(School of Finance and Mathematics, Huainan Normal University, Huainan, China;Department of Information & Computational Science, Henan Agricultural University, Zhengzhou, China)

机构地区：[1]School of Finance and Mathematics, Huainan Normal University, Huainan, China [2]Department of Information & Computational Science, Henan Agricultural University, Zhengzhou, China

出　　处：《Advances in Pure Mathematics》2023年第4期181-186,共6页理论数学进展（英文）

摘　　要：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.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.

关 键 词：Location Theory Block Graphs Inverse Optimization Connected p-Median 

分 类 号：O15[理学—数学]