Q5111750
type: Item
instance of: scholarly article
zbMATH Open document ID: 1442.68181
publication date: 2020-05-27T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 7205039
zbMATH Keywords: tree augmentation
zbMATH Keywords: logarithmic costs
zbMATH Keywords: approximation algorithm
zbMATH Keywords: half-integral extreme points
zbMATH Keywords: integrality gap
author: Zeev Nutov
MaRDI profile type: Publication
cites work: Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
cites work: Approximating (unweighted) tree augmentation via lift-and-project. II
cites work: Q4938792
cites work: On the integrality ratio for tree augmentation
cites work: A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
cites work: Parameterized Algorithms
cites work: Q4780785
cites work: Approximation Algorithms for Several Graph Augmentation Problems
cites work: Q3128880
cites work: Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
cites work: A factor 2 approximation algorithm for the generalized Steiner network problem
cites work: Approximation Algorithms for Graph Augmentation
cites work: LP-Relaxations for Tree Augmentation.
cites work: A \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from \(1\) to \(2\)
cites work: Iterative Methods in Combinatorial Optimization
cites work: Covering a laminar family by leaf to leaf links
cites work: Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation
cites work: An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
DOI: 10.4230/LIPICS.ESA.2017.61
Recommended article: On the tree augmentation problem
Recommended article: Q5091032
Recommended article: Almost optimal algorithms for diameter-optimally augmenting trees
Recommended article: Algorithms for radius-optimally augmenting trees in a metric space
Recommended article: Shortest Augmenting Paths for Online Matchings on Trees
Recommended article: A tight bound for shortest augmenting paths on trees
Recommended article: Augmenting trees to meet biconnectivity and diameter constraints
Recommended article: LP-Relaxations for Tree Augmentation.
Recommended article: LP-relaxations for tree augmentation
description: scientific article; zbMATH DE number 7205039