Sciweavers

88
Voted
APPROX
2008
Springer
134views Algorithms» more  APPROX 2008»
15 years 5 days ago
Inapproximability of Survivable Networks
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 r...
Yuval Lando, Zeev Nutov