Approximating minimum size \{1,2\}-connected networks
type: Item
instance of: scholarly article
title: Approximating minimum size \{1,2\}-connected networks
zbMATH Open document ID: 1011.68178
DOI: 10.1016/S0166-218X(02)00199-3
author: Piotr Krysta
published in: Discrete Applied Mathematics
publication date: 2003-03-09T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 1878523
zbMATH Keywords: approximation algorithms
zbMATH Keywords: graph connectivity
zbMATH Keywords: network design
zbMATH Keywords: local search
MaRDI profile type: Publication
cites work: Q4339078
cites work: Q3840352
cites work: A Better Approximation Ratio for the Minimum Sizek-Edge-Connected Spanning Subgraph Problem
cites work: Q4537740
cites work: Q3140408
cites work: Q3128880
cites work: Q4845372
cites work: Biconnectivity approximations and graph carvings
cites work: Q2762522
cites work: A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
cites work: Q4252426
cites work: An approximation algorithm for minimum-cost vertex-connectivity problems
cites work: Q2753746
cites work: A primal-dual approximation algorithm for generalized Steiner network problems
description: scientific article; zbMATH DE number 1878523