Covering a laminar family by leaf to leaf links

DOI10.1016/j.dam.2010.04.002zbMath1209.05049OpenAlexW1978176066MaRDI QIDQ987693

Yael Maduel, Zeev Nutov

Publication date: 13 August 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.04.002

zbMATH Keywords

approximation algorithmedge-connectivitylaminar familybest approximation ratioedge-cover

Mathematics Subject Classification ID

Trees (05C05) Approximation algorithms (68W25)

Related Items (9)

On the tree augmentation problem ⋮ A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius ⋮ LP-relaxations for tree augmentation ⋮ Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP ⋮ 2-node-connectivity network design ⋮ Unnamed Item ⋮ A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius ⋮ Approximation algorithms for connectivity augmentation problems ⋮ 2-node-connectivity network design

Cites Work

• Unnamed Item
• Unnamed Item
• A factor 2 approximation algorithm for the generalized Steiner network problem
• 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\)
• A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2

This page was built for publication: Covering a laminar family by leaf to leaf links