发表机构
Joint Graduate School of Mathematics for Innovation, Kyushu University（九州大学数学创新联合研究生院）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文针对悬而未决近四十年的贪心超串猜想，证明该贪心算法近似比至少为9/4，否定了其为2-近似算法的猜想。
AI 中文摘要
最短公共超串问题旨在找到包含给定集合中所有字符串作为子串的最短字符串。此前学界猜想，反复选择重叠度最高的一对字符串并合并的贪心算法是2-近似算法，该猜想已悬而未决近四十年。本文否定了该猜想，证明此算法的近似比至少为9/4。
英文摘要
The shortest common superstring problem is to find the shortest string that contains every string in a given set as a substring. It is conjectured that the greedy algorithm that repeatedly selects a pair of strings with maximum overlap and merges them is a $2$-approximation algorithm, and this conjecture had remained open for nearly four decades. In this paper, we disprove this conjecture and show that the approximation ratio of this algorithm is at least $9/4$.
