A General Framework for Approximating Min Sum Ordering Problems (Q5087715)
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 7552216
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A General Framework for Approximating Min Sum Ordering Problems |
scientific article; zbMATH DE number 7552216 |
Statements
A General Framework for Approximating Min Sum Ordering Problems (English)
0 references
1 July 2022
0 references
scheduling
0 references
search theory
0 references
Boolean function evaluation
0 references
min sum set cover
0 references
approximation algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8004196286201477
0 references
0.7987659573554993
0 references
0.7838892340660095
0 references
0.7767511010169983
0 references
