2 search results - page 1 / 1 » Minimum Augmentation of Edge-Connectivity with Monotone Requ... |
80
Voted
CATS
2007
15 years 5 months ago
2007
144
Voted
APPROX
2009
Springer
15 years 10 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...