Sciweavers

2 search results - page 1 / 1
» Minimum Augmentation of Edge-Connectivity with Monotone Requ...
Sort
View
APPROX
2009
Springer
195views Algorithms» more  APPROX 2009»
13 years 11 months ago
Approximating Node-Connectivity Augmentation Problems
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...
Zeev Nutov