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

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 113656/144643 (79%)
Visitors : 51729589 Online Users : 669

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

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

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

Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/129538

Title:	On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint
Authors:	郭桐惟 Tung-Wei Kuo
Contributors:	資科系
Keywords:	Connected dominating set; Spanner; Set cover with pairs; MIN-REP problem
Date:	2019-11
Issue Date:	2020-04-28 13:50:21 (UTC+8)
Abstract:	In the problem of minimum connected dominating set with routing cost constraint, we are given a graph \\(G=(V,E)\\) and a positive integer \\(\\alpha \\), 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 \\cup \\{u,v\\}\\) is at most \\(\\alpha \\) times that in G. For general graphs, the only known previous approximability result is an \\(O(\\log n)\\)-approximation algorithm (\\(n=\|V\|\\)) for \\(\\alpha = 1\\) by Ding et al. For any constant \\(\\alpha > 1\\), we give an \\(O(n^{1-\\frac{1}{\\alpha }}(\\log n)^{\\frac{1}{\\alpha }})\\)-approximation algorithm. When \\(\\alpha \\ge 5\\), we give an \\(O(\\sqrt{n}\\log n)\\)-approximation algorithm. Finally, we prove that, when \\(\\alpha =2\\), unless \\(NP \\subseteq DTIME(n^{poly\\log n})\\), for any constant \\(\\epsilon > 0\\), the problem admits no polynomial-time \\(2^{\\log ^{1-\\epsilon }n}\\)-approximation algorithm, improving upon the \\(\\varOmega (\\log \\delta )\\) bound by Du et al., where \\(\\delta \\) is the maximum degree of G (albeit under a stronger hardness assumption).
Relation:	Theoretical Computer Science, Vol.793, pp.140 - 151
Data Type:	article
DOI 連結:	https://doi.org/10.1016/j.tcs.2019.06.019
DOI:	10.1016/j.tcs.2019.06.019
Appears in Collections:	[資訊科學系] 期刊論文

Files in This Item:

File	Description	Size	Format
175.pdf		2482Kb	Adobe PDF2	239	View/Open

社群 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.

Loading...