Bouznif, M., & Giroudeau, R. (2011). Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks. Advances in Operations Research, 2011(2011), 201-220. https://doi.org/10.1155/2011/476939
Chicago-Zitierstil (17. Ausg.)Bouznif, M., und R. Giroudeau. "Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks." Advances in Operations Research 2011, no. 2011 (2011): 201-220. https://doi.org/10.1155/2011/476939.
MLA-Zitierstil (9. Ausg.)Bouznif, M., und R. Giroudeau. "Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks." Advances in Operations Research, vol. 2011, no. 2011, 2011, pp. 201-220, https://doi.org/10.1155/2011/476939.