Iterated rounding algorithms for the smallest \(k\)-edge connected spanning subgraph
type: Item
instance of: scholarly article
zbMATH Open document ID: 1243.68225
DOI: 10.1137/080732572
author: Harold N. Gabow
author: Suzanne R. Gallagher
published in: SIAM Journal on Computing
publication date: 2012-05-30T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6039266
zbMATH Keywords: approximation algorithms
zbMATH Keywords: network design
zbMATH Keywords: linear programming
zbMATH Keywords: graph algorithms
zbMATH Keywords: graph connectivity
zbMATH Keywords: edge connectivity
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1137/080732572
OpenAlex ID: W2083162966
title: Iterated rounding algorithms for the smallest \(k\)-edge connected spanning subgraph
description: scientific article; zbMATH DE number 6039266