The subdivision-constrained minimum spanning tree problem (Q1006063)
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 5529514
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The subdivision-constrained minimum spanning tree problem |
scientific article; zbMATH DE number 5529514 |
Statements
The subdivision-constrained minimum spanning tree problem (English)
0 references
17 March 2009
0 references
subdivision tree
0 references
polynomial equivalence
0 references
strongly polynomial time algorithm
0 references
0 references
0.8273388743400574
0 references
0.8178448677062988
0 references
0.80637127161026
0 references
0.802618145942688
0 references
0.7987779974937439
0 references
