Concatenation-based greedy heuristics for the Euclidean Steiner tree problem (Q1961044)
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 1389249
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Concatenation-based greedy heuristics for the Euclidean Steiner tree problem |
scientific article; zbMATH DE number 1389249 |
Statements
Concatenation-based greedy heuristics for the Euclidean Steiner tree problem (English)
0 references
9 March 2000
0 references
Steiner tree problem
0 references
0.883544921875
0 references
0.8613653779029846
0 references
0.8406196236610413
0 references
0.8358669281005859
0 references
0.8243850469589233
0 references
