Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks
We investigate complexity and approximation results on a processor networks where the communication delay depends on the distance between the processors performing tasks. We then prove that there is no heuristic with a performance guarantee smaller than 4/3 for makespan minimization for precedence g...
Saved in:
| Published in: | Advances in Operations Research Vol. 2011; no. 2011; pp. 201 - 220 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Cairo, Egypt
Hindawi Limiteds
01.01.2011
Hindawi Puplishing Corporation Hindawi Publishing Corporation |
| Subjects: | |
| ISSN: | 1687-9147, 1687-9155 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!