Table of Contents Author Guidelines Submit a Manuscript
Research Article
Advances in Operations Research
Volume 2012, Article ID 543215, 2 pages

Erratum to “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, UMR 5056, 161 rue Ada, 34392 Montpellier Cedex 5, France

Received 1 March 2012; Accepted 27 March 2012

Copyright © 2012 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.

Linked References

  1. 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. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  2. V. J. Rayward-Smith, “UET scheduling with unit interprocessor communication delays,” Discrete Applied Mathematics, vol. 18, no. 1, pp. 55–71, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  3. C. Lahlou, Ordonnancement dans les rseaux de processeurs : complexit et approximation, Ph.D. thesis, Universit Paris VI, 1998.
  4. C. Lahlou, “Scheduling with unit processing and communication times on a ring network: approximation results,” in Proceedings of the Europar, pp. 539–542, Springer, 1996.
  5. C. Picouleau, “UET-UCT schedules on arbitrary networks,” Tech. Rep., LITP, Blaise Pascal, Universit Paris VI, 1994. View at Google Scholar
  6. R. Giroudeau, J. C. König, and B. Valery, “Scheduling UET-tasks on a star network: complexity and approximation,” 4OR. A Quarterly Journal of Operations Research, vol. 9, no. 1, pp. 29–48, 2011. View at Publisher · View at Google Scholar