Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems
type: Item
instance of: scholarly article
title: Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems
zbMATH Open document ID: 1385.68054
DOI: 10.1007/978-3-319-34171-2_23
published in: Computer Science – Theory and Applications
publication date: 2016-07-25T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6605937
author: Zeev Nutov
MaRDI profile type: Publication
full work available at URL: 978-3-319-34171-2 23
OpenAlex ID: W2476960936
cites work: A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs
cites work: A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
cites work: Approximating minimum-cost \(k\)-node connected subgraphs via independence-free graphs
cites work: An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph
cites work: An \(O(k^3\log n)\)-approximation algorithm for vertex-connectivity survivable network design
cites work: A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
cites work: An $O(\log^2{k})$-Approximation Algorithm for the $k$-Vertex Connected Spanning Subgraph Problem
cites work: Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
cites work: Rooted \(k\)-connections in digraphs
cites work: Minimal edge-coverings of pairs of sets
cites work: An application of submodular flows
cites work: Approximating minimum cost source location problems with local vertex-connectivity demands
cites work: Q2955005
cites work: Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design
cites work: Q3128880
cites work: A factor 2 approximation algorithm for the generalized Steiner network problem
cites work: On the optimal vertex-connectivity augmentation
cites work: Improved Approximation Algorithms for Uniform Connectivity Problems
cites work: Approximating node connectivity problems via set covers
cites work: Approximating k-node Connected Subgraphs via Critical Graphs
cites work: Inapproximability of survivable networks
cites work: Approximating minimum-cost connectivity problems via uncrossable bifamilies
cites work: Approximating node-connectivity augmentation problems
cites work: Approximating minimum-cost edge-covers of crossing biset-families
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: Augmenting Undirected Node-Connectivity by One
description: scientific article; zbMATH DE number 6605937