A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius

DOI10.1016/j.tcs.2013.04.004zbMath1294.05146OpenAlexW2326678228MaRDI QIDQ388116

Nachshon Cohen, Zeev Nutov

Publication date: 19 December 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.04.004

zbMATH Keywords

approximation algorithmsedge-connectivitylaminar familylocal replacementtree augmentation

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (17)

An Improved Approximation Algorithm for the Matching Augmentation Problem ⋮ Approximating Steiner Trees and Forests with Minimum Number of Steiner Points ⋮ A simple LP-based approximation algorithm for the matching augmentation problem ⋮ On the tree augmentation problem ⋮ Node connectivity augmentation via iterative randomized rounding ⋮ On a partition LP relaxation for min-cost 2-node connected spanning subgraphs ⋮ Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree ⋮ LP-relaxations for tree augmentation ⋮ Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP ⋮ On the cycle augmentation problem: hardness and approximation algorithms ⋮ 2-node-connectivity network design ⋮ Approximating Steiner trees and forests with minimum number of Steiner points ⋮ Unnamed Item ⋮ Approximation algorithms for vertex-connectivity augmentation on the cycle ⋮ On small-depth tree augmentations ⋮ Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem ⋮ 2-node-connectivity network design

Cites Work

• Unnamed Item
• A factor 2 approximation algorithm for the generalized Steiner network problem
• Covering a laminar family by leaf to leaf links
• On the integrality ratio for tree augmentation
• On the relationship between the biconnectivity augmentation and traveling salesman problems
• An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
• Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
• A \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from \(1\) to \(2\)

This page was built for publication: A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius