| 块图中的无权1-中心问题 |
| |
| 引用本文： | 张晓芹,康丽英.块图中的无权1-中心问题[J].上海大学学报(自然科学版),2011,17(3):259-262. |
| |
| 作者姓名： | 张晓芹 康丽英 |
| |
| 作者单位： | 上海大学理学院,上海,200444 |
| |
| 基金项目： | 上海大学创新基金资助项目(SHUCX092012); 国家自然科学基金资助项目(10971131); 上海市重点学科建设资助项目(S30104) |
| |
| 摘 要： | p-中心问题是指在网络图中放置p个设施,使得每个客户到达最近设施的最大权距离最小.如果所有客户的权值均为1,则称为无权中心问题.主要研究边长为1的块图中的无权1-中心问题,借助于块图树形轮廓的构造,该问题在线性时间内可得以解决.
|
| 关 键 词： | 选址问题 中心问题 块图 网络图 |
Unweighted 1-Center Problem on Block Graphs |
| |
| ZHANG Xiao-qin,KANG Li-ying.Unweighted 1-Center Problem on Block Graphs[J].Journal of Shanghai University(Natural Science),2011,17(3):259-262. |
| |
| Authors: | ZHANG Xiao-qin KANG Li-ying |
| |
| Institution: | ZHANG Xiao-qin,KANG Li-ying(College of Sciences,Shanghai University,Shanghai 200444,China) |
| |
| Abstract: | In the p-center problem,p facilities are located in the network such that the maximum weighted distance from a client to its nearest facility is minimized.If all client weights are equal to 1,it is called an unweighted center problem.Unweighted 1-center problem is studied on block graphs with a unit edge length.It is shown that the problem can be solved in linear time using the tree structure of a block graph. |
| |
| Keywords: | location problems center problem block graph networks |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
