Approximation algorithms for scheduling with a limited number of communications (Q1575597)
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 scheduling with a limited number of communications |
scientific article; zbMATH DE number 1493386
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for scheduling with a limited number of communications |
scientific article; zbMATH DE number 1493386 |
Statements
Approximation algorithms for scheduling with a limited number of communications (English)
0 references
21 August 2000
0 references
multiprocessor scheduling
0 references
precedence constraints
0 references
communication contention
0 references
worst-case analysis
0 references
bus machine
0 references
0 references
0.90518016
0 references
0.89970815
0 references
0.89896786
0 references
0.89617825
0 references
