Survivable network design with degree or order constraints (Q3549666)
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 5485502
| 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 5485502 |
Statements
Survivable network design with degree or order constraints (English)
0 references
5 January 2009
0 references
approximation algorithms
0 references
survivable network design
0 references
degree bounded
0 references
\(\lambda\)-edge-connected
0 references
\(k\)-subgraph
0 references
minimum bounded degree spanning tree
0 references
minimum bounded degree Steiner forest
0 references
