BANSAL, Nikhil, OOSTERWIJK, Tim, VREDEVELD, Tjark und ZWAAN, Ruben, 2016. Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds. Algorithmica. 1 Dezember 2016. Vol. 76, no. 4, p. 1077-1096. DOI 10.1007/s00453-016-0116-0.
Elsevier - Harvard (with titles)Bansal, N., Oosterwijk, T., Vredeveld, T., Zwaan, R., 2016. Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds. Algorithmica 76, 1077-1096. https://doi.org/10.1007/s00453-016-0116-0
American Psychological Association 7th editionBansal, N., Oosterwijk, T., Vredeveld, T., & Zwaan, R. (2016). Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds. Algorithmica, 76(4), 1077-1096. https://doi.org/10.1007/s00453-016-0116-0
Springer - Basic (author-date)Bansal N, Oosterwijk T, Vredeveld T, Zwaan R (2016) Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds.. Algorithmica 76:1077-1096. https://doi.org/10.1007/s00453-016-0116-0
Juristische Zitierweise (Stüber) (Deutsch)Bansal, Nikhil/ Oosterwijk, Tim/ Vredeveld, Tjark/ Zwaan, Ruben, Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds., Algorithmica 2016, 1077-1096.