Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations (Q2914198)
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: Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations |
scientific article; zbMATH DE number 6085978
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations |
scientific article; zbMATH DE number 6085978 |
Statements
Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations (English)
0 references
25 September 2012
0 references
degree constrained spanning tree problems
0 references
single-commodity flow formulations
0 references
multicommodity flow formulations
0 references
0 references
0 references
0 references
0 references
0.9707575
0 references
0.9552389
0 references
0.9548093
0 references
0.9476656
0 references
0.94721127
0 references
0.9384019
0 references
0 references
0.9330154
0 references
