Scheduling in the presence of processor networks : complexity and approximation (Q2893338)
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: Scheduling in the presence of processor networks : complexity and approximation |
scientific article; zbMATH DE number 6048185
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling in the presence of processor networks : complexity and approximation |
scientific article; zbMATH DE number 6048185 |
Statements
Scheduling in the presence of processor networks : complexity and approximation (English)
0 references
20 June 2012
0 references
scheduling
0 references
non-approximability
0 references
processor network model
0 references
0 references
0.90651834
0 references
0.9048647
0 references
0.90378904
0 references
0.9029139
0 references
0.9011669
0 references
