Solving the maximum duo-preservation string mapping problem with linear programming (Q2440161)

From MaRDI portal
Revision as of 12:04, 25 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/tcs/ChenCSPWT14, #quickstatements; #temporary_batch_1732532539753)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    0 references
    0 references
    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

    Identifiers