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 profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.20057 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4251613475 / rank | |||
Normal rank | |||
Revision as of 18:40, 19 March 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
