Service restrictions from February 12-22, 2026—more information on the University Library website
American Psychological Association 6th edition

Goos, G., Hartmanis, J., Leeuwen, J., Jansen, K., Rolim, J., & Sviridenko, M. I. (1998). Best possible approximation algorithm for MAX SAT with cardinality constraint. https://doi.org/10.1007/BFb0053975

ISO-690 (author-date, English)

GOOS, Gerhard, HARTMANIS, Juris, LEEUWEN, Jan, JANSEN, Klaus, ROLIM, José and SVIRIDENKO, Maxim I., 1998. Best possible approximation algorithm for MAX SAT with cardinality constraint.

Modern Language Association 9th edition

Goos, G., J. Hartmanis, J. Leeuwen, K. Jansen, J. Rolim, and M. I. Sviridenko. Best possible approximation algorithm for MAX SAT with cardinality constraint. 1998, https://doi.org/10.1007/BFb0053975.

Mohr Siebeck - Recht (Deutsch - Österreich)

Goos, Gerhard/Hartmanis, Juris/Leeuwen, Jan/Jansen, Klaus/Rolim, José/Sviridenko, Maxim I.: Best possible approximation algorithm for MAX SAT with cardinality constraint., 1998.

Emerald - Harvard

Goos, G., Hartmanis, J., Leeuwen, J., Jansen, K., Rolim, J. and Sviridenko, M.I. (1998), Best possible approximation algorithm for MAX SAT with cardinality constraint., Vol. , available at:https://doi.org/10.1007/BFb0053975.

Warning: These citations may not always be 100% accurate.