Table of Contents Author Guidelines Submit a Manuscript
Erratum

An erratum for this article has been published. To view the erratum, please click here.

Advances in Operations Research
Volume 2011, Article ID 476939, 20 pages
http://dx.doi.org/10.1155/2011/476939
Research Article

Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks

1Laboratoire G-SCOP, 46 avenue Félix Viallet, 38031 Grenoble Cedex 1, France
2LIRMM, 161 rue Ada, UMR 5056, 34392 Montpellier Cedex 5, France

Received 26 October 2010; Revised 22 March 2011; Accepted 4 April 2011

Academic Editor: Ching-Jong Liao

Copyright © 2011 M. Bouznif and R. Giroudeau. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

How to Cite this Article

M. Bouznif and R. Giroudeau, “Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks,” Advances in Operations Research, vol. 2011, Article ID 476939, 20 pages, 2011. https://doi.org/10.1155/2011/476939.