Abstract: An e cient heuristic is presented for the problem of nding a minimum-size kconnected spanning subgraph of an (undirected or directed) simple graph G =(V � E). There are four versions of the problem, and the approximation guarantees are as follows: minimum-size k-node connected spanning subgraph of an undirected graph 1+[1=k], minimum-size k-node connected spanning subgraph of a directed graph 1+[1=k], minimum-size k-edge connected spanning subgraph of an undirected graph and minimum-size k-edge connected spanning subgraph of a directed graph
|
7711
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
1289
|
The Probabilistic Method
– Alon, Spencer, et al.
- 1992
|
|
889
|
Graph Theory with Applications
– Bondy, Murty
- 1976
|
|
670
|
Modern graph theory
– Bollobás
- 1998
|
|
313
|
Matching Theory
– Lovász, Plummer
- 1986
|
|
184
|
Combinatorial Problems and Exercises
– Lovász
- 1993
|
|
168
|
Worst-Case Analysis of a New Heuristic for the Traveling Salesman Problem, Management Science Research
– Christofides
- 1976
|
|
58
|
Biconnectivity approximations and graph carvings
– Khuller, Vishkin
- 1994
|
|
54
|
A matroid approach to finding edge connectivity and packing arborescences, STOC
– Gabow
- 1991
|
|
52
|
Improved approximation algorithms for uniform connectivity problems
– Khuller, Raghavachari
- 1996
|
|
45
|
Tarjan, \Faster scaling algorithms for general graph matching problems
– Gabow, E
- 1991
|
|
40
|
Random sampling in cut, flow, and network design problems
– Karger
- 1999
|
|
38
|
Approximation algorithms for finding highly connected subgraphs," in Appoximation Algorithms for NP-hard
– Khuller
- 1997
|
|
34
|
Edge-disjoint branchings, in Combinatorial Algorithms
– Edmonds
- 1973
|
|
28
|
A Linear-Time Algorithm for Finding a Sparse kConnected Spanning Subgraph of a k-Connected Graph
– Nagamochi, Ibaraki
- 1992
|
|
25
|
A scaling algorithm for weighted matching on general graphs
– Gabow
- 1985
|
|
25
|
On the optimal vertex-connectivity augmentation
– Jord'an
- 1995
|
|
24
|
Approximating the minimum equivalent digraph
– Khuller, Raghavachari, et al.
- 1995
|
|
20
|
On sparse subgraphs preserving connectivity properties
– Frank, Ibaraki, et al.
- 1993
|
|
19
|
Worst-case analysis of a new heuristic for the traveling salesman problem
– Christo
- 1976
|
|
19
|
Minimale n-fach kantenzusammenhangende Graphen
– Mader
- 1971
|
|
17
|
Ecken vom Grad n in minimalen n-fach zusammenh"angenden Graphen, Archive der Mathematik 23
– Mader
- 1972
|
|
16
|
Improved Approximation Algorithms for Biconnected Subgraphs via Better Lower Bounding Techniques
– Garg, Santosh, et al.
- 1993
|
|
16
|
Scan-first search and sparse certificates: an improved parallel algorithm for k-vertex connectivity
– Cheriyan, Kao, et al.
- 1993
|
|
16
|
On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem
– Czumaj, Lingas
- 1999
|
|
15
|
N.: On strongly connected digraphs with bounded cycle length
– Khuller, Raghavachari, et al.
- 1996
|
|
14
|
A better approximation ratio for the minimum size k-edge-connected spanning subgraph problem
– Fernandes
- 1998
|
|
9
|
Submodular functions in graph theory
– Frank
- 1993
|
|
9
|
An improved approximation algorithm for minimum size 2-edge connected spanning subgraphs
– Cheriyan, Sebö, et al.
- 1412
|
|
8
|
Computing minimal spanning subgraphs in linear time
– Han, Kelsen, et al.
- 1995
|
|
8
|
Techniques for the Design of Parallel Graph Algorithms
– Thurimella
- 1989
|
|
7
|
Increasing the vertex-connectivity in directed graphs
– Jord'an
- 1993
|
|
6
|
Tarjan, "Faster scaling algorithms for general graph matching problems
– Gabow, E
- 1991
|
|
5
|
The number of vertices of degree k in a minimally k-edge-connected graph
– Cai
- 1993
|
|
4
|
On finding minimal two-connected subgraphs
– Kelsen, Ramachandran
- 1995
|
|
3
|
Edge-Disjoint Branchings," in Combinatorial Algorithms
– Edmonds
- 1972
|
|
3
|
Approximating matchings in parallel
– Fischer, Goldberg, et al.
- 1993
|
|
3
|
A decomposition theorem for bipartite graphs, in: Theory of Graphs
– Gupta
- 1967
|
|
3
|
On the minimum 2-edge connected subgraph
– Vempala, Vetta
- 2000
|
|
2
|
Scan- rst search and sparse certi cates: An improved parallel algorithm for k-vertex connectivity
– Cheriyan, Kao, et al.
- 1993
|
|
2
|
A Better Approximation Ratio for the Minimum k-edge-connected Spanning Subgraph Problem
– Fernandes
- 1997
|
|
2
|
A matroid approach to nding edge connectivity andpacking arborescences
– Gabow
- 1995
|
|
2
|
Random sampling in cut, ow, and network design problems. Journal version draft
– Karger
- 1997
|
|
2
|
Minimal n-Fach Zusammenhangenden Digraphen
– Mader
- 1985
|
|
2
|
A linear-time algorithm for nding a sparse k-connected spanning subgraph of a k-connected graph," Algorithmica 7
– Nagamochi, Ibaraki
- 1992
|
|
1
|
Approximating biconnectivity in parallel
– Chong, Lam
- 1995
|
|
1
|
Improving biconnectivity approximation via local optimization
– Chong, Lam
- 1996
|
|
1
|
Towards more precise parallel biconnectivity approximation
– Chong, Lam
- 1996
|
|
1
|
Matching," in Handbook of Operations Research and Management Science (Eds
– Gerards
- 1995
|
|
1
|
On nding minimal two-connected subgraphs
– Kelsen, Ramachandran
- 1995
|
