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

@@ Property / cites work @@
+Q4230321
@@ Property / cites work: Q4230321 / rank @@
+Normal rank
@@ Property / cites work @@
+On dependent randomized rounding algorithms
@@ Property / cites work: On dependent randomized rounding algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234151
@@ Property / cites work: Q4234151 / rank @@
+Normal rank
@@ Property / cites work @@
+.879-approximation algorithms for MAX CUT and MAX 2SAT
+Normal rank
@@ Property / cites work @@
+On approximation of max-vertex-cover
@@ Property / cites work: On approximation of max-vertex-cover / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Generalized Maximum Dispersion with Linear Programming
+Normal rank
@@ Property / cites work @@
+Approximating reversal distance for strings with bounded number of duplicates
+Normal rank
@@ Property / cites work @@
+Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set
+Normal rank
@@ Property / cites work @@
+Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
+Normal rank
@@ Property / cites work @@
+Randomized rounding: A technique for provably good algorithms and algorithmic proofs
+Normal rank
@@ Property / cites work @@
+Q4400841
@@ Property / cites work: Q4400841 / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/tcs/ChenCSPWT14
@@ Property / DBLP publication ID: journals/tcs/ChenCSPWT14 / rank @@
+Normal rank