Erratum to ``Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks'' (Q447565): Difference between revisions
From MaRDI portal
Latest revision as of 08:37, 13 November 2024
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