Iterative rounding approximation algorithms for degree-bounded node-connectivity network design (Q2949211)
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 6491615
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Iterative rounding approximation algorithms for degree-bounded node-connectivity network design |
scientific article; zbMATH DE number 6491615 |
Statements
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (English)
0 references
8 October 2015
0 references
iterative rounding
0 references
node connectivity
0 references
network design
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8814954161643982
0 references
0.8775097131729126
0 references
0.8553102612495422
0 references
0.8549392223358154
0 references
0.8462123870849609
0 references
