Survivable network design with degree or order constraints (Q3575159)
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: Survivable network design with degree or order constraints |
scientific article; zbMATH DE number 5731562
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Survivable network design with degree or order constraints |
scientific article; zbMATH DE number 5731562 |
Statements
Survivable Network Design with Degree or Order Constraints (English)
0 references
7 July 2010
0 references
approximation algorithms
0 references
survivable network design
0 references
degree bounded
0 references
\(\lambda\)-edge-connected
0 references
\(k\)-subgraph
0 references
0.8844323754310608
0 references
0.8778142333030701
0 references
0.8764631748199463
0 references
0.8708317279815674
0 references
0.8705397844314575
0 references
