Hardness of Approximation for Vertex-Connectivity Network Design Problems (original) (raw)
Guy Kortsarz2004, SIAM Journal on Computing
visibility
…
description
18 pages
link
1 file
In the survivable network design problem (SNDP), the goal is to find a minimum-cost spanning subgraph satisfying certain connectivity requirements. We study the vertex-connectivity variant of SNDP in which the input specifies, for each pair of vertices, a required number of vertex-disjoint paths connecting them.