.png){kind=icon}
返回
An Eight-Approximation Algorithm for Computing Rooted Three-Vertex Connected Minimum Steiner Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2012.170.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
For a given undirected (edge) weighted graph G = (V, E), a terminal set S subset of V and a root r is an element of S, the rooted k-vertex connected minimum Steiner network (kVSMN(r)) problem requires to construct a minimum-cost subgraph of G such that each terminal in S \ {r} is k-vertex connected to r. As an important problem in survivable network design, the kVSMNr problem is known to be NP-hard even when k = 1 [14]. For k = 3 this paper presents a simple combinatorial eight-approximation algorithm, improving the known best ratio 14 of Nutov [20]. Our algorithm constructs an approximate 3VSMNr through augmenting a two-vertex connected counterpart with additional edges of bounded cost to the optimal. We prove that the total cost of the added edges is at most six times of the optimal by showing that the edges in a 3VSMNr compose a subgraph containing our solution in such a way that each edge appears in the subgraph at most six times.
Keyword:
Rooted three-vertex connectivity
survivable network design
Steiner minimum network
approximation algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
引用论文
.png){kind=icon}
Effectiveness of progressive muscle relaxation technique on physical symptoms among patients receiving chemotherapy渐进性肌肉放松技术对接受化疗患者躯体症状有效性的研究
PREAI
分享收藏
Recent pattern of drug sensitivity of most commonly isolated uropathogens from Central India近期印度中部地区最常见分离尿路致病菌的药物敏感性模式
OAAI
OAAI分享收藏
查看更多内容