APA (7th ed.) Citation

Huo, Y., & Leung, J. Y. (2010). Fast approximation algorithms for job scheduling with processing set restrictions. Theoretical computer science, 411(44-46), 3947-3955. https://doi.org/10.1016/j.tcs.2010.08.008

Chicago Style (17th ed.) Citation

Huo, Yumei, and Joseph Y.-T Leung. "Fast Approximation Algorithms for Job Scheduling with Processing Set Restrictions." Theoretical Computer Science 411, no. 44-46 (2010): 3947-3955. https://doi.org/10.1016/j.tcs.2010.08.008.

MLA (9th ed.) Citation

Huo, Yumei, and Joseph Y.-T Leung. "Fast Approximation Algorithms for Job Scheduling with Processing Set Restrictions." Theoretical Computer Science, vol. 411, no. 44-46, 2010, pp. 3947-3955, https://doi.org/10.1016/j.tcs.2010.08.008.