政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/129539

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | 全文笔数/总笔数 : 114205/145239 (79%)
造访人次 : 52623514 在线人数 : 1098

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

政大機構典藏 > 資訊學院 > 資訊科學系 > 期刊論文 > Item 140.119/129539

请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/129539

题名:	On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint
作者:	郭桐惟 Tung-Wei Kuo
贡献者:	資科系
关键词:	Connected dominating set; Spanner; Set cover with pairs; MIN-REP problem
日期:	2019-02
上传时间:	2020-04-28 13:50:37 (UTC+8)
摘要:	In the problem of minimum connected dominating set with routing cost constraint, we are given a graph G=(V,E)G=(V,E) and a positive integer αα, and the goal is to find the smallest connected dominating set D of G such that, for any two non-adjacent vertices u and v in G, the number of internal nodes on the shortest path between u and v in the subgraph of G induced by D∪{u,v}D∪{u,v} is at most αα times that in G. For general graphs, the only known previous approximability result is an O(logn)O(log⁡n)-approximation algorithm (n=\|V\|n=\|V\|) for α=1α=1 by Ding et al. For any constant α>1α>1, we give an O(n1−1α(logn)1α)O(n1−1α(log⁡n)1α)-approximation algorithm. When α≥5α≥5, we give an O(n−−√logn)O(nlog⁡n)-approximation algorithm. Finally, we prove that, when α=2α=2, unless NP⊆DTIME(npolylogn)NP⊆DTIME(npolylog⁡n), for any constant ϵ>0ϵ>0, the problem admits no polynomial-time 2log1−ϵn2log1−ϵ⁡n-approximation algorithm, improving upon the Ω(logδ)Ω(log⁡δ) bound by Du et al., where δδ is the maximum degree of G (albeit under a stronger hardness assumption).
關聯:	International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2018: Algorithms for Sensor Systems pp 32-46
数据类型:	conference
DOI 連結:	https://doi.org/10.1007/978-3-030-14094-6_3
DOI:	10.1007/978-3-030-14094-6_3
显示于类别:	[資訊科學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
174.pdf		510Kb	Adobe PDF2	231	检视/开启

在政大典藏中所有的数据项都受到原著作权保护.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

数据加载中.....