An approximation algorithm for the minimum weight vertex-connectivity problem in complete graphs with sharpened triangle inequality

被引：0

作者：

Ferrante, Alessandro ^{[1
]}

Parente, Mimmo ^{[1
]}

机构：

[1] Dipartimento di Informatica ed Applicazioni, Università degli Studi di Salerno, Baronissi, Italy

来源：

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2003年 / 2841卷

关键词：

D O I：

10.1007/978-3-540-45208-9_12

中图分类号：

学科分类号：

摘要：

引用

页码：137 / 149

共 50 条

[1] An approximation algorithm for the minimum weight vertex-connectivity problem in complete graphs with sharpened triangle inequality
Ferrante, A
Parente, M
THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2003, 2841 : 137 - 149
[2] On the vertex-connectivity problem for graphs with sharpened triangle inequality
Ferrante, A
Parente, M
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2004, 15 (05) : 701 - 715
[3] An approximation algorithm for minimum-cost vertex-connectivity problems
R. Ravi
D. P. Williamson
Algorithmica, 1997, 18 : 21 - 43
[4] An approximation algorithm for minimum-cost vertex-connectivity problems
Ravi, R
Williamson, DP
ALGORITHMICA, 1997, 18 (01) : 21 - 43
[5] Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems
Ravi, R
Williamson, DP
PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 1000 - 1001
[6] Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems
Algorithmica, 2002, 34 : 98 - 107
[7] On 2-approximation to the vertex-connectivity in graphs
Naganiochi, H
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2005, E88D (01): : 12 - 16
[8] Better algorithms for minimum weight vertex-connectivity problems
Auletta, V
Parente, M
STACS 97 - 14TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1997, 1200 : 547 - 558
[9] Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs
Ishii, Toshimasa
JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (04) : 570 - 578
[10] Greedy approximation for source location problem with vertex-connectivity requirements in undirected graphs
Ishii, Toshimasa
ALGORITHMS AND COMPUTATION, 2007, 4835 : 29 - +

← 1 2 3 4 5 →