Lower bounds for the relative greedy algorithm for approximating Steiner trees (Q5469129)
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 5023794
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for the relative greedy algorithm for approximating Steiner trees |
scientific article; zbMATH DE number 5023794 |
Statements
Lower bounds for the relative greedy algorithm for approximating Steiner trees (English)
0 references
16 May 2006
0 references
approximation algorithms
0 references
analysis of algorithms
0 references
graph algorithms
0 references
Steiner tree problem
0 references
lower bounds
0 references
0.8472405672073364
0 references
0.8472086787223816
0 references
0.8466172814369202
0 references
