A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius (Q388116): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2013.04.004 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2013.04.004 / rank | |||
Normal rank | |||
Latest revision as of 16:06, 9 December 2024
scientific article
| 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 |
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
