New heuristics for the vertex coloring problem based on semidefinite programming (Q351547): Difference between revisions

@@ Property / cites work @@
+New approximation guarantee for chromatic number
@@ Property / cites work: New approximation guarantee for chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+Semidefinite programming relaxations for graph coloring and maximal clique problems
+Normal rank
@@ Property / cites work @@
+A semidefinite programming-based heuristic for graph coloring
+Normal rank
@@ Property / cites work @@
+Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
+Normal rank
@@ Property / cites work @@
+Block-diagonal semidefinite programming hierarchies for 0/1 programming
+Normal rank
@@ Property / cites work @@
+Approximate graph coloring by semidefinite programming
+Normal rank
@@ Property / cites work @@
+On the Shannon capacity of a graph
@@ Property / cites work: On the Shannon capacity of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Regularization Methods for Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+Copositive and semidefinite relaxations of the quadratic assignment problem
+Normal rank
@@ Property / cites work @@
+A boundary point method to solve semidefinite programs
+Normal rank