Inapproximability of Survivable Networks

  title={Inapproximability of Survivable Networks},
  author={Yuval Lando and Zeev Nutov},
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation ratio preserving reduction from Directed SNDP to Undirected SNDP. Our reduction extends and widely generalizes as well as significantly simplifies the main results of [9]. Using it, we derive some new hardness of approximation results, as follows. We show that directed and undirected variants of SNDP and of k-Connected… CONTINUE READING

Similar Papers

Loading similar papers…