The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings (Q313766)
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 6626370
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings |
scientific article; zbMATH DE number 6626370 |
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
0 references
0 references
0.7951346039772034
0 references
0.7901059985160828
0 references
0.7819128036499023
0 references
0.7804709076881409
0 references
0.7794961333274841
0 references
