A 7/2-approximation algorithm for the maximum duo-preservation string mapping problem (Q5369545)
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 6792420
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 7/2-approximation algorithm for the maximum duo-preservation string mapping problem |
scientific article; zbMATH DE number 6792420 |
Statements
17 October 2017
0 references
polynomial approximation
0 references
max duo-preservation string mapping problem
0 references
min common string partition problem
0 references
local search
0 references
A 7/2-approximation algorithm for the Maximum Duo-Preservation String Mapping Problem (English)
0 references
0.9191542863845824
0 references
0.9003946185112
0 references
0.8989388942718506
0 references
0.8838833570480347
0 references
0.8799709677696228
0 references
