On the Greedy Superstring Conjecture
From MaRDI portal
Publication:3440268
DOI10.1137/040619144zbMath1115.68163OpenAlexW2007974556WikidataQ122958453 ScholiaQ122958453MaRDI QIDQ3440268
Publication date: 22 May 2007
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/040619144
Related Items
The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings, All instantiations of the greedy algorithm for the shortest common superstring problem are equivalent, Relationship between superstring and compression measures: new insights on the greedy conjecture, Practical lower and upper bounds for the Shortest Linear Superstring