Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems (Q2444145): Difference between revisions

@@ Property / cites work @@
+Q4252398
@@ Property / cites work: Q4252398 / rank @@
+Normal rank
@@ Property / cites work @@
+The RPR2 rounding technique for semidefinite programs
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
+Normal rank
@@ Property / cites work @@
+Q4542566
@@ Property / cites work: Q4542566 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743406
@@ Property / cites work: Q5743406 / rank @@
+Normal rank
@@ Property / cites work @@
+Quasi-Random PCP and Hardness of 2-Catalog Segmentation
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm for the \(2\)-catalog segmentation problem using semidefinite programming relaxation
+Normal rank
@@ Property / cites work @@
+Q4461068
@@ Property / cites work: Q4461068 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the 2-catalog segmentation problem using semidefinite programming relaxations
+Normal rank
@@ Property / cites work @@
+A .699-approximation algorithm for Max-Bisection.
@@ Property / cites work: A .699-approximation algorithm for Max-Bisection. / rank @@
+Normal rank
@@ Property / cites work @@
+Outward rotations
@@ Property / cites work: Outward rotations / rank @@
+Normal rank