An improved algorithm for the Steiner tree problem with bounded edge-length (Q2237889)
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 improved algorithm for the Steiner tree problem with bounded edge-length |
scientific article; zbMATH DE number 7415930
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved algorithm for the Steiner tree problem with bounded edge-length |
scientific article; zbMATH DE number 7415930 |
Statements
An improved algorithm for the Steiner tree problem with bounded edge-length (English)
0 references
28 October 2021
0 references
Steiner trees
0 references
approximation algorithms
0 references
network design
0 references
randomized algorithms
0 references
greedy algorithms
0 references
0 references
0 references
0.8579890727996826
0 references
0.8320358991622925
0 references
0.8229426145553589
0 references
0.8176480531692505
0 references
