Erratum to ``Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks'' (Q447565): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Marwane Bouznif / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68M20 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C60 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6076658 / rank | |||
Normal rank | |||
Revision as of 10:26, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Erratum to ``Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks'' |
scientific article |
Statements
Erratum to ``Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks'' (English)
0 references
4 September 2012
0 references
