Why greed works for shortest common superstring problem (Q1038476)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Why greed works for shortest common superstring problem |
scientific article; zbMATH DE number 5634882
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Why greed works for shortest common superstring problem |
scientific article; zbMATH DE number 5634882 |
Statements
Why greed works for shortest common superstring problem (English)
0 references
18 November 2009
0 references
shortest common superstring
0 references
smoothed analysis
0 references
polynomial time approximation scheme
0 references
1.0000002
0 references
0.9087547
0 references
0.90493983
0 references
0.90424675
0 references
0.90206206
0 references
0.89829636
0 references
0.8958845
0 references
0.8903763
0 references
