Bringmann, Karl Algorithms and Complexity, MPI for Informatics, Max Planck Society;
https://drops.dagstuhl.de/opus/volltexte/2021/14108/pdf/LIPIcs-ICALP-2021-39.pdf (Publisher version)
https://creativecommons.org/licenses/by/4.0/legalcode (Copyright transfer agreement)
Bringmann, K., & Das, D. (2021). A Linear-Time n0.4-Approximation for Longest Common Subsequence. In N. Bansal, E. Merelli, & J. Worrell (Eds.), 48th International Colloquium on Automata, Languages, and Programming (pp. 1-20). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ICALP.2021.39.