The competitiveness of randomized algorithms for on-line Steiner tree and on-line spanning tree problems (Q1313740): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / 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: Dynamic Steiner Tree Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:56, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The competitiveness of randomized algorithms for on-line Steiner tree and on-line spanning tree problems |
scientific article |
Statements
The competitiveness of randomized algorithms for on-line Steiner tree and on-line spanning tree problems (English)
0 references
19 May 1994
0 references
competitive analysis
0 references
randomized on-line algorithms
0 references
on-line Steiner tree
0 references
on-line spanning tree
0 references
