4 search results - page 1 / 1 » Augmenting undirected node-connectivity by one |
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
COCOA
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
STOC
2010
ACM
13 years 9 months ago
2010
ACM
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...