Greedy Conjecture for Strings of Length 4

DOI10.1007/978-3-319-19929-0_26zbMath1432.68607OpenAlexW2395147110MaRDI QIDQ2942268

Evgeniy Sluzhaev, Sergey Savinov, Alexander S. Kulikov

Publication date: 20 August 2015

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19929-0_26

Mathematics Subject Classification ID

Approximation algorithms (68W25) Algorithms on strings (68W32)

Related Items (3)

All instantiations of the greedy algorithm for the shortest common superstring problem are equivalent ⋮ Collapsing Superstring Conjecture ⋮ Relationship between superstring and compression measures: new insights on the greedy conjecture

This page was built for publication: Greedy Conjecture for Strings of Length 4