A probabilistic PTAS for shortest common superstring (Q393897)
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: A probabilistic PTAS for shortest common superstring |
scientific article; zbMATH DE number 6249999
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A probabilistic PTAS for shortest common superstring |
scientific article; zbMATH DE number 6249999 |
Statements
A probabilistic PTAS for shortest common superstring (English)
0 references
24 January 2014
0 references
shortest common superstring
0 references
approximation
0 references
average-case analysis
0 references
semi-random input
0 references
greedy superstring
0 references
0 references
0 references
0.9865848422050476
0 references
0.8836641311645508
0 references
0.878714919090271
0 references
0.8719192147254944
0 references
