An improved approximation algorithm for the \(2\)-catalog segmentation problem using semidefinite programming relaxation (Q2358849): Difference between revisions

@@ 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 @@
+An improved rounding method and semidefinite programming relaxation for graph partition
+Normal rank
@@ Property / cites work @@
+Segmentation problems
@@ Property / cites work: Segmentation problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4461068
@@ Property / cites work: Q4461068 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH
+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