An almost tight lower bound for the scheduling problem to meet two min-sum objectives (Q384219)
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: An almost tight lower bound for the scheduling problem to meet two min-sum objectives |
scientific article; zbMATH DE number 6233809
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An almost tight lower bound for the scheduling problem to meet two min-sum objectives |
scientific article; zbMATH DE number 6233809 |
Statements
An almost tight lower bound for the scheduling problem to meet two min-sum objectives (English)
0 references
27 November 2013
0 references
bi-criteria
0 references
scheduling
0 references
approximation algorithm
0 references
