Solving the maximum duo-preservation string mapping problem with linear programming (Q2440161): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2014.02.017 / rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/tcs/ChenCSPWT14 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2014.02.017 / rank | |||
Normal rank | |||
Latest revision as of 15:54, 18 December 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
0 references
0 references
0 references
