Beating approximation factor two for weighted tree augmentation with bounded costs (Q4629987)
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: Beating approximation factor two for weighted tree augmentation with bounded costs |
scientific article; zbMATH DE number 7044621
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Beating approximation factor two for weighted tree augmentation with bounded costs |
scientific article; zbMATH DE number 7044621 |
Statements
Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs (English)
0 references
28 March 2019
0 references
tree augmentation problem
0 references
approximation algorithm
0 references
linear programming
0 references
network design
0 references
rounding technique
0 references
0.9981738924980164
0 references
0.8509616255760193
0 references
0.8466079235076904
0 references
0.8256559371948242
0 references
