2000 character limit reached
Deterministic Longest Common Subsequence Approximation in Near-Linear Time
Published 30 Jul 2025 in cs.DS | (2507.22486v1)
Abstract: We provide a deterministic algorithm that outputs an $O(n{3/4} \log n)$-approximation for the Longest Common Subsequence (LCS) of two input sequences of length $n$ in near-linear time. This is the first deterministic approximation algorithm for LCS that achieves a sub-linear approximation ratio in near-linear time.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
