A probabilistic PTAS for shortest common superstring (Q393897): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2013.12.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2023382282 / rank | |||
Normal rank | |||
Revision as of 20:59, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A probabilistic PTAS for shortest common superstring |
scientific article |
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
