POLOCZEK, MATTHIAS, SCHNITGER, GEORG, WILLIAMSON, DAVID P. und VAN ZUYLEN, ANKE, 2017. GREEDY ALGORITHMS FOR THE MAXIMUM SATISFIABILITY PROBLEM: SIMPLE ALGORITHMS AND IN APPROXIMABILITY BOUNDS. SIAM Journal on Computing. 1 Juli 2017. Vol. 46, no. 3, p. 1029-1061. DOI 10.1137/15 M1053369.
Elsevier - Harvard (with titles)POLOCZEK, M., SCHNITGER, G., WILLIAMSON, D.P., VAN ZUYLEN, A., 2017. GREEDY ALGORITHMS FOR THE MAXIMUM SATISFIABILITY PROBLEM: SIMPLE ALGORITHMS AND IN APPROXIMABILITY BOUNDS. SIAM Journal on Computing 46, 1029-1061. https://doi.org/10.1137/15 M1053369
American Psychological Association 7th editionPOLOCZEK, M., SCHNITGER, G., WILLIAMSON, D. P., & VAN ZUYLEN, A. (2017). GREEDY ALGORITHMS FOR THE MAXIMUM SATISFIABILITY PROBLEM: SIMPLE ALGORITHMS AND IN APPROXIMABILITY BOUNDS. SIAM Journal on Computing, 46(3), 1029-1061. https://doi.org/10.1137/15 M1053369
Springer - Basic (author-date)POLOCZEK M, SCHNITGER G, WILLIAMSON DP, VAN ZUYLEN A (2017) GREEDY ALGORITHMS FOR THE MAXIMUM SATISFIABILITY PROBLEM: SIMPLE ALGORITHMS AND IN APPROXIMABILITY BOUNDS.. SIAM Journal on Computing 46:1029-1061. https://doi.org/10.1137/15 M1053369
Juristische Zitierweise (Stüber) (Deutsch)POLOCZEK, MATTHIAS/ SCHNITGER, GEORG/ WILLIAMSON, DAVID P./ VAN ZUYLEN, ANKE, GREEDY ALGORITHMS FOR THE MAXIMUM SATISFIABILITY PROBLEM: SIMPLE ALGORITHMS AND IN APPROXIMABILITY BOUNDS., SIAM Journal on Computing 2017, 1029-1061.