Degree constrained node-connectivity problems (Q486998)
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 6387693
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Degree constrained node-connectivity problems |
scientific article; zbMATH DE number 6387693 |
Statements
Degree constrained node-connectivity problems (English)
0 references
19 January 2015
0 references
network design
0 references
node-connectivity
0 references
degree bounds
0 references
approximation algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0.948380410671234
0 references
0.8775097131729126
0 references
0.8693662881851196
0 references
0.8510594964027405
0 references
0.8425915241241455
0 references
