Liu, F., Liu, H., & Wong, P. W. H. (2021). Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs. Theory of computing systems, 65(6), 1009-1032. https://doi.org/10.1007/s00224-021-10037-w
Citace podle Chicago (17th ed.)Liu, Fu-Hong, Hsiang-Hsuan Liu, a Prudence W. H. Wong. "Greedy Is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs." Theory of Computing Systems 65, no. 6 (2021): 1009-1032. https://doi.org/10.1007/s00224-021-10037-w.
Citace podle MLA (9th ed.)Liu, Fu-Hong, et al. "Greedy Is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs." Theory of Computing Systems, vol. 65, no. 6, 2021, pp. 1009-1032, https://doi.org/10.1007/s00224-021-10037-w.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..