Approximation algorithms for connectivity augmentation problems
type: Item
instance of: scholarly article
title: Approximation algorithms for connectivity augmentation problems
DOI: 10.1007/978-3-030-79416-3_19
author: Zeev Nutov
publication date: 2022-03-21T00:00:00Z
full work available at URL: https://arxiv.org/abs/2009.13257
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7493539
MaRDI profile type: Publication
OpenAlex ID: W3177131004
cites work: Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
cites work: Augmenting hypergraphs by edges of size two
cites work: Parameterized Algorithms to Preserve Connectivity
cites work: Covering symmetric supermodular functions by graphs
cites work: A unifying approach to splitting-off
cites work: Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree
cites work: Steiner Tree Approximation via Iterative Randomized Rounding
cites work: Q4234099
cites work: Q4607935
cites work: Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
cites work: Q3085455
cites work: On the Cycle Augmentation Problem: hardness and approximation algorithms
cites work: Improved approximation for tree augmentation: saving by rewiring
cites work: Local edge-connectivity augmentation in hypergraphs is NP-complete
cites work: A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2
cites work: Covering a laminar family by leaf to leaf links
cites work: Approximating connectivity augmentation problems
cites work: On the tree augmentation problem
cites work: Q5092379
cites work: An approximation algorithm for minimum-cost vertex-connectivity problems
description: scientific article; zbMATH DE number 7493539