A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
type: Item
instance of: scholarly article
title: A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
zbMATH Open document ID: 1012.68227
DOI: 10.1016/S0166-218X(02)00201-9
author: Liang Zhao
author: Hiroshi Nagamochi
author: Toshihide Ibaraki
published in: Discrete Applied Mathematics
publication date: 2003-03-09T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1878538
zbMATH Keywords: approximation algorithm
zbMATH Keywords: primal dual method
zbMATH Keywords: survivable network designproblem
zbMATH Keywords: graph
zbMATH Keywords: hypergraph
zbMATH Keywords: hyperedges
MaRDI profile type: Publication
cites work: Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
cites work: Maximal Flow Through a Network
cites work: A General Approximation Technique for Constrained Forest Problems
cites work: Q3128880
cites work: A new approach to the maximum-flow problem
cites work: A factor 2 approximation algorithm for the generalized Steiner network problem
cites work: Q4252324
cites work: An approximation algorithm for minimum-cost vertex-connectivity problems
cites work: Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems
cites work: The primal-dual method for approximation algorithms
cites work: A primal-dual approximation algorithm for generalized Steiner network problems
full work available at URL: s0166-218x(02)00201-9
OpenAlex ID: W2037625746
description: scientific article; zbMATH DE number 1878538