Erratum to ``Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks'' (Q447565): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q442399 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1155/2012/543215 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4206342720 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: UET scheduling with unit interprocessor communication delays / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling \(UET\)-tasks on a star network: complexity and approximation / rank | |||
Normal rank | |||
Latest revision as of 16:09, 5 July 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
