Improved LP-based algorithms for the closest string problem (Q1762033)
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: Improved LP-based algorithms for the closest string problem |
scientific article; zbMATH DE number 6107507
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved LP-based algorithms for the closest string problem |
scientific article; zbMATH DE number 6107507 |
Statements
Improved LP-based algorithms for the closest string problem (English)
0 references
15 November 2012
0 references
closest string problem
0 references
heuristics
0 references
core problem
0 references
0.8404605388641357
0 references
0.8261672258377075
0 references
0.8206902146339417
0 references
0.8202464580535889
0 references
