Covering a laminar family by leaf to leaf links
From MaRDI portal
(Redirected from Publication:987693)
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
Cites work
- scientific article; zbMATH DE number 1833404 (Why is no real title available?)
- scientific article; zbMATH DE number 1405806 (Why is no real title available?)
- A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
- A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
- A factor 2 approximation algorithm for the generalized Steiner network problem
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- On the integrality ratio for tree augmentation
- On the relationship between the biconnectivity augmentation and traveling salesman problems
Cited in
(15)- Fast distributed approximation for TAP and 2-edge-connectivity
- On the tree augmentation problem
- 2-node-connectivity network design
- A \((1 + \ln 2)\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
- Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation
- Approximation algorithms for connectivity augmentation problems
- scientific article; zbMATH DE number 7205039 (Why is no real title available?)
- 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
- 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
- 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)