All instantiations of the greedy algorithm for the shortest common superstring problem are equivalent (Q2146125)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7542412
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | All instantiations of the greedy algorithm for the shortest common superstring problem are equivalent |
scientific article; zbMATH DE number 7542412 |
Statements
All instantiations of the greedy algorithm for the shortest common superstring problem are equivalent (English)
0 references
15 June 2022
0 references
superstring
0 references
shortest common superstring
0 references
approximation
0 references
greedy algorithms
0 references
greedy conjecture
0 references
0.9262349
0 references
0.9222755
0 references
0.92171085
0 references
0.9198751
0 references
0.9074156
0 references
0.9004672
0 references
0.8958845
0 references
0.8958845
0 references
