Chen, C. (2024). Efficient Approximation Algorithms for Scheduling Coflows With Precedence Constraints in Identical Parallel Networks to Minimize Weighted Completion Time. IEEE transactions on services computing, 17(5), 2349-2364. https://doi.org/10.1109/TSC.2023.3344481
Citace podle Chicago (17th ed.)Chen, Chi-Yeh. "Efficient Approximation Algorithms for Scheduling Coflows With Precedence Constraints in Identical Parallel Networks to Minimize Weighted Completion Time." IEEE Transactions on Services Computing 17, no. 5 (2024): 2349-2364. https://doi.org/10.1109/TSC.2023.3344481.
Citace podle MLA (9th ed.)Chen, Chi-Yeh. "Efficient Approximation Algorithms for Scheduling Coflows With Precedence Constraints in Identical Parallel Networks to Minimize Weighted Completion Time." IEEE Transactions on Services Computing, vol. 17, no. 5, 2024, pp. 2349-2364, https://doi.org/10.1109/TSC.2023.3344481.