On randomizing two derandomized greedy algorithms (Q547862)
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 5913528
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On randomizing two derandomized greedy algorithms |
scientific article; zbMATH DE number 5913528 |
Statements
On randomizing two derandomized greedy algorithms (English)
0 references
27 June 2011
0 references
randomized algorithms
0 references
approximation algorithms, random graphs
0 references
0.92339003
0 references
0.9129277
0 references
0.9019607
0 references
0.88315165
0 references
0 references
0 references
0.8725027
0 references
