Query-competitive algorithms for cheapest set problems under uncertainty (Q899309)
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: Query-competitive algorithms for cheapest set problems under uncertainty |
scientific article; zbMATH DE number 6524280
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Query-competitive algorithms for cheapest set problems under uncertainty |
scientific article; zbMATH DE number 6524280 |
Statements
Query-competitive algorithms for cheapest set problems under uncertainty (English)
0 references
28 December 2015
0 references
online algorithms
0 references
competitive analysis
0 references
verification
0 references
minimum multi-cut
0 references
matroid
0 references
0.9896408319473268
0 references
0.8181132078170776
0 references
0.7886446714401245
0 references
0.7637002468109131
0 references
