Runtime analysis of evolutionary algorithms for the depth restricted \((1,2)\)-minimum spanning tree problem (Q5215487)
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: Runtime analysis of evolutionary algorithms for the depth restricted (1,2)-minimum spanning tree problem |
scientific article; zbMATH DE number 7166026
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Runtime analysis of evolutionary algorithms for the depth restricted \((1,2)\)-minimum spanning tree problem |
scientific article; zbMATH DE number 7166026 |
Statements
Runtime analysis of evolutionary algorithms for the depth restricted (1,2)-minimum spanning tree problem (English)
0 references
11 February 2020
0 references
\((1,2)\)-minimum spanning tree
0 references
depth-restricted \((1,2)\)
0 references
evolutionary algorithm
0 references
minimum spanning tree
0 references
runtime analysis
0 references
0.9066618084907532
0 references
0.8523758053779602
0 references
0.8284196853637695
0 references
0.8024359941482544
0 references
0.7988160252571106
0 references
