Erratum to ``Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks

DOI10.1155/2012/543215zbMATH Open1246.90049DBLPjournals/advor/BouznifG12OpenAlexW4206342720WikidataQ58698841 ScholiaQ58698841MaRDI QIDQ447565FDOQ447565

Authors: M. Bouznif, Rodolphe Giroudeau 

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• UET scheduling with unit interprocessor communication delays
• Scheduling \(UET\)-tasks on a star network: complexity and approximation
• Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks

This page was built for publication: Erratum to ``Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q447565)