Greedy Conjecture for Strings of Length 4

DOI10.1007/978-3-319-19929-0_26MaRDI QIDQ2942268zbMATH OpenOpenAlexFDO

Authors Sergey Savinov, Evgeniy Sluzhaev, 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)

Recommendations

• On a Conjecture about Binary Strings Distribution
• Gallai's conjecture for graphs of girth at least four
• Greedy palindromic lengths
• The combinatorial complexity of a finite string
• Some results on greedy algorithm conjectures
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• The greedy algorithm for the minimum common string partition problem
• Greedy algorithms for the shortest common superstring that are asymptotically optimal
• On the index-conjecture on length four minimal zero-sum sequences
• Greedy algorithms for the shortest common superstring that are asymtotically optimal

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942268)