A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius (Q388116)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius |
scientific article; zbMATH DE number 6239363
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius |
scientific article; zbMATH DE number 6239363 |
Statements
A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius (English)
0 references
19 December 2013
0 references
tree augmentation
0 references
edge-connectivity
0 references
laminar family
0 references
local replacement
0 references
approximation algorithms
0 references
0 references
0 references
0 references
0.9998073
0 references
0.8945771
0 references
0 references
0.8836309
0 references
0.8828198
0 references
0.8807733
0 references
0.8807733
0 references
0.8804954
0 references
