The selective fixing algorithm for the closest string problem (Q336747)
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: The selective fixing algorithm for the closest string problem |
scientific article; zbMATH DE number 6650557
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The selective fixing algorithm for the closest string problem |
scientific article; zbMATH DE number 6650557 |
Statements
The selective fixing algorithm for the closest string problem (English)
0 references
10 November 2016
0 references
closest string problem
0 references
heuristics
0 references
continuous relaxation
0 references
0.8283854722976685
0 references
0.8262909054756165
0 references
0.8261672258377075
0 references
0.8092384934425354
0 references
0.7965375185012817
0 references
