Approximating the 2-catalog segmentation problem using semidefinite programming relaxations (Q4650629): Difference between revisions

@@ Property / cites work @@
+Relations between average case complexity and approximation complexity
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
+Normal rank
@@ Property / cites work @@
+A New Way of Using Semidefinite Programming with Applications to Linear Equations mod p
+Normal rank
@@ Property / cites work @@
+Outward rotations
@@ Property / cites work: Outward rotations / rank @@
+Normal rank
@@ Property / cites work @@
+Semidefinite relaxation and nonconvex quadratic optimization
+Normal rank
@@ Property / cites work @@
+An improved rounding method and semidefinite programming relaxation for graph partition
+Normal rank
@@ Property / cites work @@
+Approximation of dense-\(n/2\)-subgraph and the complement of min-bisection
+Normal rank