The sequential sum problem and performance bounds on the greedy algorithm for the on‐line Steiner problem (Q4680416)
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 2173326
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The sequential sum problem and performance bounds on the greedy algorithm for the on‐line Steiner problem |
scientific article; zbMATH DE number 2173326 |
Statements
The sequential sum problem and performance bounds on the greedy algorithm for the on‐line Steiner problem (English)
0 references
1 June 2005
0 references
sequential sum problem
0 references
on-line Steiner tree problem
0 references
dynamic greedy algorithm
0 references
vertex greedy algorithm
0 references
0.8843086361885071
0 references
0.8656203150749207
0 references
0.8338606357574463
0 references
