All instantiations of the greedy algorithm for the shortest common superstring problem are equivalent (Q2146125)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | All instantiations of the greedy algorithm for the shortest common superstring problem are equivalent |
scientific article |
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
