Survivable network design problems with weighted degree constraints (Q2999651)
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 5888305
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Survivable network design problems with weighted degree constraints |
scientific article; zbMATH DE number 5888305 |
Statements
16 May 2011
0 references
degree constraint
0 references
edge connectivity
0 references
iterative rounding
0 references
network design
0 references
0.860916256904602
0 references
0.8601940870285034
0 references
0.8022221326828003
0 references
0.7962188720703125
0 references
