The minimum substring cover problem (Q958306)
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 5377242
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum substring cover problem |
scientific article; zbMATH DE number 5377242 |
Statements
The minimum substring cover problem (English)
0 references
3 December 2008
0 references
approximation algorithms
0 references
dictionary generation
0 references
local-ratio
0 references
randomized rounding
0 references
substring cover
0 references
0 references
0.9774316549301147
0 references
0.8734191060066223
0 references
0.8249391913414001
0 references
0.7990774512290955
0 references
0.7935988306999207
0 references
