An improved approximation algorithm for scheduling under arborescence precedence constraints (Q5089259)
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 improved approximation algorithm for scheduling under arborescence precedence constraints |
scientific article; zbMATH DE number 7559455
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved approximation algorithm for scheduling under arborescence precedence constraints |
scientific article; zbMATH DE number 7559455 |
Statements
18 July 2022
0 references
scheduling
0 references
precedence constraints
0 references
Lagrangian duality
0 references
0 references
0 references
An improved approximation algorithm for scheduling under arborescence precedence constraints (English)
0 references
