Solving the maximum duo-preservation string mapping problem with linear programming (Q2440161): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2014.02.017 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2004490284 / rank | |||
Normal rank | |||
Revision as of 23:02, 19 March 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
