Gairing, M., Monien, B., & Woclaw, A. (2007). A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. Theoretical computer science, 380(1), 87-99. https://doi.org/10.1016/j.tcs.2007.02.056
Citace podle Chicago (17th ed.)Gairing, Martin, Burkhard Monien, a Andreas Woclaw. "A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines." Theoretical Computer Science 380, no. 1 (2007): 87-99. https://doi.org/10.1016/j.tcs.2007.02.056.
Citace podle MLA (9th ed.)Gairing, Martin, et al. "A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines." Theoretical Computer Science, vol. 380, no. 1, 2007, pp. 87-99, https://doi.org/10.1016/j.tcs.2007.02.056.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..