CSpace  > 应用数学研究所
Approximation for the minimum cost doubly resolving set problem
Chen, Xujin; Hu, Xiaodong; Wang, Changjun
2016-01-04
发表期刊THEORETICAL COMPUTER SCIENCE
ISSN0304-3975
卷号609页码:526-543
摘要Locating source of diffusion in networks is crucial for controlling and preventing epidemic risks. It has been studied under various probabilistic models. In this paper, we study source location from a deterministic point of view by modeling it as the minimum cost doubly resolving set (DRS) problem, which is a strengthening of the well-known metric dimension problem. Let G be an undirected graph on n vertices, where each vertex has a nonnegative cost. A vertex subset S of G is a doubly resolving set (DRS) of G if for every pair of vertices u, v in G, there exist x, y is an element of S such that the difference of distances (in terms of number of edges) between u and x, y is not equal to the difference of distances between v and x, y. The minimum cost DRS problem consists of finding a DRS in G with minimum total cost. We establish Theta(Inn) approximability of the minimum DRS problem on general graphs for both weighted and unweighted versions. This provides the first explicit lower and upper bounds on approximation for the minimum (cost) DRS, which are nearly tight. Moreover, we design the first known strongly polynomial time exact algorithms for the minimum cost DRS problem on general wheels and trees with additional constant k >= 0 edges. (C) 2015 Elsevier B.V. All rights reserved.
关键词Source location Doubly resolving set Approximation algorithms Polynomial-time solvability Metric dimension
DOI10.1016/j.tcs.2015.03.048
语种英语
WOS研究方向Computer Science
WOS类目Computer Science, Theory & Methods
WOS记录号WOS:000367275000003
出版者ELSEVIER SCIENCE BV
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/21628
专题应用数学研究所
通讯作者Wang, Changjun
作者单位Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China
推荐引用方式
GB/T 7714
Chen, Xujin,Hu, Xiaodong,Wang, Changjun. Approximation for the minimum cost doubly resolving set problem[J]. THEORETICAL COMPUTER SCIENCE,2016,609:526-543.
APA Chen, Xujin,Hu, Xiaodong,&Wang, Changjun.(2016).Approximation for the minimum cost doubly resolving set problem.THEORETICAL COMPUTER SCIENCE,609,526-543.
MLA Chen, Xujin,et al."Approximation for the minimum cost doubly resolving set problem".THEORETICAL COMPUTER SCIENCE 609(2016):526-543.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Chen, Xujin]的文章
[Hu, Xiaodong]的文章
[Wang, Changjun]的文章
百度学术
百度学术中相似的文章
[Chen, Xujin]的文章
[Hu, Xiaodong]的文章
[Wang, Changjun]的文章
必应学术
必应学术中相似的文章
[Chen, Xujin]的文章
[Hu, Xiaodong]的文章
[Wang, Changjun]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。