A note on Rooted Survivable Networks

@article{Nutov2009ANO,
  title={A note on Rooted Survivable Networks},
  author={Zeev Nutov},
  journal={Inf. Process. Lett.},
  year={2009},
  volume={109},
  pages={1114-1119}
}
The (undirected) Rooted Survivable Network Design (Rooted SND) problem is: given a complete graph on node set V with edge-costs, a root s ∈ V , and (node-)connectivity requirements {r(t) : t ∈ T ⊆ V }, find a minimum cost subgraph G that contains r(t) internally-disjoint st-paths for all t ∈ T . For large values of k = maxt∈T r(t) Rooted SND is at least as hard to approximate as Directed Steiner Tree [Lando & Nutov, APPROX 2008]. For Rooted SND [Chuzhoy & Khanna, FOCS 08] gave recently an… CONTINUE READING

Similar Papers

Loading similar papers…