Survivable network design

15

JAL
2002

71views more JAL 2002»

A primal-dual schema based approximation algorithm for the element connectivity problem

13 years 4 months ago

The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...

Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, Dav...

claim paper

Read More »

16

click to vote

IPCO
1993

138views Optimization» more IPCO 1993»

An efficient approximation algorithm for the survivable network design problem

13 years 6 months ago

Download www-math.mit.edu

The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...

Harold N. Gabow, Michel X. Goemans, David P. Willi...

claim paper

Read More »

9

click to vote

STOC
2007
ACM

71views Algorithms» more STOC 2007»

Survivable network design with degree or order constraints

14 years 5 months ago