Worst-case performance of some heuristics for Steiner's problem in directed graphs (Q1313772): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(93)90185-c / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1970669216 / rank | |||
Normal rank | |||
Latest revision as of 10:58, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-case performance of some heuristics for Steiner's problem in directed graphs |
scientific article |
Statements
Worst-case performance of some heuristics for Steiner's problem in directed graphs (English)
0 references
24 February 1994
0 references
Steiner tree
0 references
Steiner's problem
0 references
directed graphs
0 references
heuristic algorithms
0 references
worst-case performance
0 references
0 references
