Approximation guarantees for shortest superstrings: simpler and better (Q6953190)
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 8069637
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation guarantees for shortest superstrings: simpler and better |
scientific article; zbMATH DE number 8069637 |
Statements
Approximation guarantees for shortest superstrings: simpler and better (English)
0 references
24 July 2025
0 references
shortest superstring problem
0 references
approximation algorithms
0 references
0 references
0 references
