Better algorithms for minimum weight vertex-connectivity problems

被引：0
|
作者：
Auletta, V [1 ]
Parente, M [1 ]
机构：
[1] Univ Salerno, Dipartimento Informat & Applicaz, I-84081 Baronissi, Italy
来源：
STACS 97 - 14TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE | 1997年 / 1200卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Given a Ic vertex-connected graph with weighted edges, we study the problem of finding a minimum weight spanning subgraph which is k vertex-connected, for small values of L. The problem is known to be NP-hard for any k, even when edges have no weight. In this paper we provide a 2 approximation algorithm for the cases k = 2, 3 and a 3 approximation algorithm for the case k = 4. The best approximation factors present in literature are 2, 3 + 2/3 and 4 + 1/6, respectively.
引用
收藏
页码：547 / 558
页数：12
相关论文
共 50 条
12345