Bringmann, Karl Algorithms and Complexity, MPI for Informatics, Max Planck Society;
3568398.pdf (Publisher version), 630KB
Bringmann, K., Cohen-Addad, V., & Das, D. (2023). A Linear-Time n0.4-Approximation for Longest Common Subsequence. ACM Transactions on Algorithms, 19(1): 9, pp. 1-24. doi:10.1145/3568398.