Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6544331
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph |
scientific article; zbMATH DE number 6544331 |
Statements
Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (English)
0 references
23 February 2016
0 references
combinatorial optimization
0 references
approximation algorithms
0 references
network design
0 references
Steiner tree
0 references
\(k\)-edge connected
0 references
0 references
0 references
0 references
0 references
0.9964305758476256
0 references
0.9380176067352296
0 references
0.935334086418152
0 references
0.8454148769378662
0 references
0.8099440932273865
0 references
