Solving the maximum duo-preservation string mapping problem with linear programming (Q2440161): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:34, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the maximum duo-preservation string mapping problem with linear programming |
scientific article |
Statements
Solving the maximum duo-preservation string mapping problem with linear programming (English)
0 references
27 March 2014
0 references
approximation algorithm
0 references
constrained maximum induced subgraph problem
0 references
duo-preservation string mapping
0 references
linear programming
0 references
integer programming
0 references
randomized rounding
0 references
