Improved approximation for the maximum duo-preservation string mapping problem (Q5265098)
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 6461618
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximation for the maximum duo-preservation string mapping problem |
scientific article; zbMATH DE number 6461618 |
Statements
Improved Approximation for the Maximum Duo-Preservation String Mapping Problem (English)
0 references
22 July 2015
0 references
polynomial approximation
0 references
max duo-preserving string mapping problem
0 references
min common string partition problem
0 references
linear programming
0 references
configuration LP
0 references
0.9508659839630128
0 references
0.9328545928001404
0 references
0.8989388942718506
0 references
0.8930677175521851
0 references
0.8887022733688354
0 references
