A Steiner point candidate-based heuristic framework for the Steiner tree problem in graphs (Q6551932)
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 7861630
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Steiner point candidate-based heuristic framework for the Steiner tree problem in graphs |
scientific article; zbMATH DE number 7861630 |
Statements
A Steiner point candidate-based heuristic framework for the Steiner tree problem in graphs (English)
0 references
7 June 2024
0 references
