30 search results - page 1 / 6 » Approximating Rooted Connectivity Augmentation Problems |
65
Voted
ALGORITHMICA
2006
14 years 10 months ago
2006
APPROX
2009
Springer
15 years 4 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...
JCSS
2008
14 years 9 months ago
2008
ESA
2008
Springer
14 years 11 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
SODA
2012
ACM
13 years 8 days ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...