A General Framework for Approximating Min Sum Ordering Problems (Q5087715): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1287/ijoc.2021.1124 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/IJOC.2021.1124 / rank | |||
Normal rank | |||
Latest revision as of 15:52, 30 December 2024
scientific article; zbMATH DE number 7552216
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
