Greedy Conjecture for Strings of Length 4

Download PDF
Open Webpage

Alexander S. Kulikov, Sergey Savinov, Evgeniy Sluzhaev

Published: 01 Jan 2015, Last Modified: 22 Jul 2025CPM 2015EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: In this short note, we prove that the greedy conjecture for the shortest common superstring problem is true for strings of length 4.