62 search results - page 1 / 13 » Approximating Node-Connectivity Augmentation Problems |
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...
115
click to vote
APPROX
2000
Springer
15 years 2 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
ALGORITHMICA
2006
14 years 10 months ago
2006
68
Voted
JCSS
2008
14 years 10 months ago
2008
SOFSEM
2009
Springer
15 years 7 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...