The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings (Q313766): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 00:58, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings |
scientific article |
Statements
The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings (English)
0 references
12 September 2016
0 references
approximation algorithm
0 references
shortest superstring problem
0 references
stringology
0 references
data compression
0 references
assembly
0 references
greedy conjecture
0 references