RANDOMIZATION YIELDS SIMPLE O(n <font>log</font><sup>⋆</sup> n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS (Q4016895)
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 89471
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | RANDOMIZATION YIELDS SIMPLE O(n <font>log</font><sup>⋆</sup> n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS |
scientific article; zbMATH DE number 89471 |
Statements
RANDOMIZATION YIELDS SIMPLE O(n <font>log</font><sup>⋆</sup> n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS (English)
0 references
16 January 1993
0 references
euclidean minimum spanning tree
0 references
randomized algorithms
0 references
influence graph
0 references
skeleton
0 references
polygon
0 references
Delaunay triangulation
0 references
0 references
0.87187415
0 references
0.87074286
0 references
0.8685763
0 references
