A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph

Saved in:

Bibliographic Details
Published in:	Discrete Applied Mathematics Vol. 126; pp. 275 - 289
Main Authors:	Liang Zhao, Toshihide Ibaraki, Hiroshi Nagamochi
Format:	Journal Article
Language:	Japanese
Published:	Springer Berlin Heidelberg 01.01.2001
Subjects:	Applied Mathematics Approximation algorithm Discrete Mathematics and Combinatorics Graph Hypergraph Primal dual method Survivable network design problem
ISSN:	0166-218X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
ISSN:	0166-218X
DOI:	10.1016/s0166-218x(02)00201-9