A case study of de-randomization methods for combinatorial approximation algorithms (Q1282206)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A case study of de-randomization methods for combinatorial approximation algorithms |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A case study of de-randomization methods for combinatorial approximation algorithms |
scientific article |
Statements
A case study of de-randomization methods for combinatorial approximation algorithms (English)
0 references
27 July 1999
0 references
conditional probabilities method
0 references
randomized rounding
0 references
routing
0 references
packing
0 references
covering
0 references
random walks
0 references
bounded independence technique
0 references
