Solving the maximum duo-preservation string mapping problem with linear programming (Q2440161): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: DBLP publication ID (P1635): journals/tcs/ChenCSPWT14, #quickstatements; #temporary_batch_1732532539753
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: Q4230321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dependent randomized rounding algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: .879-approximation algorithms for MAX CUT and MAX 2SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximation of max-vertex-cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Generalized Maximum Dispersion with Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating reversal distance for strings with bounded number of duplicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized rounding: A technique for provably good algorithms and algorithmic proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400841 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/tcs/ChenCSPWT14 / rank
 
Normal rank

Latest revision as of 12:04, 25 November 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
    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