Randomized greedy: new variants of some classic approximation algorithms (Q5365069)
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 6783421
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Randomized greedy: new variants of some classic approximation algorithms |
scientific article; zbMATH DE number 6783421 |
Statements
29 September 2017
0 references
0.9825918078422546
0 references
0.8345689177513123
0 references
0.8237895369529724
0 references
0.809487521648407
0 references
0.7849083542823792
0 references
