1 paper
Qingyun Chen, Bundit Laekhanukit, Chao Liao +1
In the classical survivable network design problem (SNDP), we are given an undirected graph G=(V,E) with costs on edges and a connectivity requirement k(s,t) for each pair of v…