Scheduling \(UET\)-tasks on a star network: complexity and approximation (Q538278)
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 \(UET\)-tasks on a star network: complexity and approximation |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling \(UET\)-tasks on a star network: complexity and approximation |
scientific article |
Statements
Scheduling \(UET\)-tasks on a star network: complexity and approximation (English)
0 references
25 May 2011
0 references
scheduling
0 references
non-approximability
0 references
approximation
0 references
0 references
0 references
