Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity (Q5753762): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/03155986.1990.11732136 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2275351491 / rank | |||
Normal rank | |||
Latest revision as of 22:20, 19 March 2024
scientific article; zbMATH DE number 4189495
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity |
scientific article; zbMATH DE number 4189495 |
Statements
Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity (English)
0 references
1990
0 references
super-modularity
0 references
greedy procedure
0 references
approximate solution
0 references
Steiner tree problem
0 references
reoptimization
0 references
minimum spanning tree
0 references
undirected graph
0 references
