Covering a laminar family by leaf to leaf links
From MaRDI portal
Publication:987693
DOI10.1016/J.DAM.2010.04.002zbMATH Open1209.05049OpenAlexW1978176066MaRDI QIDQ987693FDOQ987693
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
Cites Work
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
- On the relationship between the biconnectivity augmentation and traveling salesman problems
- A factor 2 approximation algorithm for the generalized Steiner network problem
- On the integrality ratio for tree augmentation
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
- A \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from \(1\) to \(2\)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (12)
- On the tree augmentation problem
- 2-node-connectivity network design
- Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation
- Approximation algorithms for connectivity augmentation problems
- Title not available (Why is that?)
- A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius
- Approximation algorithms for node and element connectivity augmentation problems
- Improved first player strategy for the zero-sum sequential uncrossing game
- LP-relaxations for tree augmentation
- 2-node-connectivity network design
- Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP
- A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
Recommendations
- LP-Relaxations for Tree Augmentation. 👍 👎
- Improved approximation for tree augmentation: saving by rewiring 👍 👎
- A \((1 + \ln 2)\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius 👍 👎
- A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius 👍 👎
- Fast distributed approximation for TAP and 2-edge-connectivity 👍 👎
This page was built for publication: Covering a laminar family by leaf to leaf links
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987693)
