A Lower Bound on Approximation Algorithms for the Closest Substring Problem (Q3611982)
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 Lower Bound on Approximation Algorithms for the Closest Substring Problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Lower Bound on Approximation Algorithms for the Closest Substring Problem |
scientific article |
Statements
A Lower Bound on Approximation Algorithms for the Closest Substring Problem (English)
0 references
3 March 2009
0 references
