The sequential sum problem and performance bounds on the greedy algorithm for the on‐line Steiner problem (Q4680416): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4527000 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Steiner tree problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5689037 / rank | |||
Normal rank | |||
Revision as of 11:02, 10 June 2024
scientific article; zbMATH DE number 2173326
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
