Scheduling \(UET\)-tasks on a star network: complexity and approximation (Q538278): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68M20 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 5899499 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
scheduling | |||
| Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
non-approximability | |||
| Property / zbMATH Keywords: non-approximability / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
approximation | |||
| Property / zbMATH Keywords: approximation / rank | |||
Normal rank | |||
Revision as of 10:35, 1 July 2023
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
