An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions (Q992574)
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: An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions |
scientific article; zbMATH DE number 5781810
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions |
scientific article; zbMATH DE number 5781810 |
Statements
An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions (English)
0 references
9 September 2010
0 references
Steiner tree
0 references
multi-objective problem
0 references
Pareto-optimal solution
0 references
bottleneck function
0 references
0 references
0 references
0.8122619390487671
0 references
0.8064354062080383
0 references
