A primal-dual approximation algorithm for the survivable network design problem in hypergraphs

Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki. A primal-dual approximation algorithm for the survivable network design problem in hypergraphs. Discrete Applied Mathematics, 126(2-3):275-289, 2003.

Authors

Liang Zhao

This author has not been identified. Look up 'Liang Zhao' in Google

Hiroshi Nagamochi

This author has not been identified. Look up 'Hiroshi Nagamochi' in Google

Toshihide Ibaraki

This author has not been identified. Look up 'Toshihide Ibaraki' in Google