A \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from \(1\) to \(2\)
type: Item
instance of: scholarly article
title: A \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from \(1\) to \(2\)
zbMATH Open document ID: 1260.68464
author: Guy Even
author: Guy Kortsarz
author: Zeev Nutov
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6150271
zbMATH Keywords: tree augmentation
zbMATH Keywords: laminar family
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2010.12.010
OpenAlex ID: W2029514348
cites work: Q4780785
cites work: A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
cites work: An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
DOI: 10.1016/J.IPL.2010.12.010
description: scientific article; zbMATH DE number 6150271