Erratum to “Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks”
Approximation Results If the network is a ring, there are two approximation results for Rayward-Smith's [2] algorithm as follows. (i) In the general case, the performance ratio is upper bounded by m/2+3/2-1/m , and there exists an instance for which the performance ratio is equal to m/8+1/2 [3]...
Saved in:
| Published in: | Advances in operations research Vol. 2012; no. 2012; pp. 1 - 2 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Cairo, Egypt
Hindawi Puplishing Corporation
2012
Hindawi Publishing Corporation John Wiley & Sons, Inc |
| Subjects: | |
| ISSN: | 1687-9147, 1687-9155 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Approximation Results If the network is a ring, there are two approximation results for Rayward-Smith's [2] algorithm as follows. (i) In the general case, the performance ratio is upper bounded by m/2+3/2-1/m , and there exists an instance for which the performance ratio is equal to m/8+1/2 [3]. (ii) If the number of processors is even, the upper-bound can be improved to 1+(3/8)m-1/2m , and there exists an instance such that the performance ratio is equal to [left ceiling]m[right ceiling] [4]. Proof. [...]nonapproximability results can be deduced. |
|---|---|
| Bibliography: | erratum ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1687-9147 1687-9155 |
| DOI: | 10.1155/2012/543215 |