Approximation algorithms for multi-agent scheduling to minimize total weighted completion time (Q989525)
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: Approximation algorithms for multi-agent scheduling to minimize total weighted completion time |
scientific article; zbMATH DE number 5773823
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for multi-agent scheduling to minimize total weighted completion time |
scientific article; zbMATH DE number 5773823 |
Statements
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time (English)
0 references
20 August 2010
0 references
multi-agent scheduling
0 references
total weighted completion time
0 references
approximation algorithm
0 references
FPTAS
0 references
multi-objective shortest-path problem
0 references
