Faster approximation algorithms for weighted triconnectivity augmentation problems
type: Item
instance of: scholarly article
title: Faster approximation algorithms for weighted triconnectivity augmentation problems
zbMATH Open document ID: 0908.90262
DOI: 10.1016/S0167-6377(97)00045-X
author: Zeev Nutov
author: Michal Penn
published in: Operations Research Letters
publication date: 1999-03-23T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1207140
zbMATH Keywords: graph
zbMATH Keywords: vertex connectivity
zbMATH Keywords: augmentation problem
zbMATH Keywords: minimum-weight augmenting edge-set
zbMATH Keywords: 3-approximation algorithm
MaRDI profile type: Publication
cites work: Augmentation Problems
cites work: An application of submodular flows
cites work: Approximation Algorithms for Several Graph Augmentation Problems
cites work: Q3140422
cites work: Dividing a Graph into Triconnected Components
cites work: On the optimal vertex-connectivity augmentation
cites work: Improved Approximation Algorithms for Uniform Connectivity Problems
cites work: Approximation Algorithms for Graph Augmentation
cites work: NOTE Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems
cites work: An approximation algorithm for minimum-cost vertex-connectivity problems
cites work: Q5524326
description: scientific article; zbMATH DE number 1207140