Erratum to “Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks”
Main Authors: | M. Bouznif, R. Giroudeau |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2012-01-01
|
Series: | Advances in Operations Research |
Online Access: | http://dx.doi.org/10.1155/2012/543215 |
Similar Items
-
Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks
by: M. Bouznif, et al.
Published: (2011-01-01) -
Approximation and Inapproximability Results on Balanced Connected Partitions of Graphs
by: Yoshiko Wakabayashi, et al.
Published: (2007-01-01) -
Cautionary Tales of Inapproximability
by: Budden, David, et al.
Published: (2017) -
Conditional Inapproximability and Limited Independence
by: Austrin, Per
Published: (2008) -
Inapproximability of the Edge-Contraction Problem
by: HIRATA, Tomio, et al.
Published: (2006)