The NP-Hardness of the Connected p-Median Problem on Bipartite Graphs and Split Graphs

Shun-Chieh Chang,William Chung-Kung Yen, Yue-Li Wang,Jia-Jie Liu

CHIANG MAI JOURNAL OF SCIENCE（2013）

引用 0|浏览7

暂无评分

摘要

In this paper, we study a variant of the p-median problem on graphs in which the subgraph induced by the p-median is asked to be connected, and this problem is called the connected p-median problem. We show that the connected p-median problem is NP-hard on bipartite graphs and split graphs, respectively.

查看译文

关键词

Connected p-median,NP-hard,bipartite graph,split graph

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要