FLEISCHER, Lisa, GOEMANS, Michel X., MIRROKNI, Vahab S. und SVIRIDENKO, Maxim, 2011. Tight Approximation Algorithms for Maximum Separable Assignment Problems. Mathematics of Operations Research. 1 August 2011. Vol. 36, no. 3, p. 416-431. DOI 10.1287/moor.1110.0499.
Elsevier - Harvard (with titles)Fleischer, L., Goemans, M.X., Mirrokni, V.S., Sviridenko, M., 2011. Tight Approximation Algorithms for Maximum Separable Assignment Problems. Mathematics of Operations Research 36, 416-431. https://doi.org/10.1287/moor.1110.0499
American Psychological Association 7th editionFleischer, L., Goemans, M. X., Mirrokni, V. S., & Sviridenko, M. (2011). Tight Approximation Algorithms for Maximum Separable Assignment Problems. Mathematics of Operations Research, 36(3), 416-431. https://doi.org/10.1287/moor.1110.0499
Springer - Basic (author-date)Fleischer L, Goemans MX, Mirrokni VS, Sviridenko M (2011) Tight Approximation Algorithms for Maximum Separable Assignment Problems.. Mathematics of Operations Research 36:416-431. https://doi.org/10.1287/moor.1110.0499
Juristische Zitierweise (Stüber) (Deutsch)Fleischer, Lisa/ Goemans, Michel X./ Mirrokni, Vahab S./ Sviridenko, Maxim, Tight Approximation Algorithms for Maximum Separable Assignment Problems., Mathematics of Operations Research 2011, 416-431.