Czumaj, A., Ga̧sieniec, L., Gaur, D. R., Krishnamurti, R., Rytter, W., & Zito, M. (2003). On polynomial-time approximation algorithms for the variable length scheduling problem. Theoretical computer science, 302(1), 489-495. https://doi.org/10.1016/S0304-3975(03)00141-5
Citácia podle Chicago (17th ed.)Czumaj, Artur, Leszek Ga̧sieniec, Daya Ram Gaur, Ramesh Krishnamurti, Wojciech Rytter, a Michele Zito. "On Polynomial-time Approximation Algorithms for the Variable Length Scheduling Problem." Theoretical Computer Science 302, no. 1 (2003): 489-495. https://doi.org/10.1016/S0304-3975(03)00141-5.
Citácia podľa MLA (8th ed.)Czumaj, Artur, et al. "On Polynomial-time Approximation Algorithms for the Variable Length Scheduling Problem." Theoretical Computer Science, vol. 302, no. 1, 2003, pp. 489-495, https://doi.org/10.1016/S0304-3975(03)00141-5.