Erratum to ``Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks
From MaRDI portal
Publication:447565
DOI10.1155/2012/543215zbMath1246.90049WikidataQ58698841 ScholiaQ58698841MaRDI QIDQ447565
Rodolphe Giroudeau, Marwane Bouznif
Publication date: 4 September 2012
Published in: Advances in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/543215
90C35: Programming involving graphs or networks
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Cites Work