An average case analysis of a greedy algorithm for the on-line Steiner tree problem (Q1921250): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Dynamic Steiner Tree Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An upper bound for the average length of the euclidean minimum spanning tree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A proof of the Gilbert-Pollak conjecture on the Steiner ratio / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5586854 / rank | |||
Normal rank | |||
Latest revision as of 14:03, 24 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An average case analysis of a greedy algorithm for the on-line Steiner tree problem |
scientific article |
Statements
An average case analysis of a greedy algorithm for the on-line Steiner tree problem (English)
0 references
10 November 1996
0 references
Euclidean tree
0 references
on-line algorithm
0 references
Steiner tree
0 references
0 references
0 references
