Linear Index Coding via Semidefinite Programming (Q5410256): Difference between revisions

@@ Property / cites work @@
+On the Hardness of 4-Coloring a 3-Colorable Graph
@@ Property / cites work: On the Hardness of 4-Coloring a 3-Colorable Graph / rank @@
+Normal rank
@@ Property / cites work @@
+An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs
+Normal rank
@@ Property / cites work @@
+Conditional Hardness for Approximate Coloring
@@ Property / cites work: Conditional Hardness for Approximate Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+New approximation algorithms for graph coloring
@@ Property / cites work: New approximation algorithms for graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Index Coding With Side Information
@@ Property / cites work: Index Coding With Side Information / rank @@
+Normal rank
@@ Property / cites work @@
+Network information flow
@@ Property / cites work: Network information flow / rank @@
+Normal rank
@@ Property / cites work @@
+Orthogonal representations over finite fields and the chromatic number of graphs
+Normal rank
@@ Property / cites work @@
+Nonlinear Index Coding Outperforming the Linear Optimum
+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 @@
+On the Hardness of Approximating the Network Coding Capacity
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating the chromatic number
+Normal rank
@@ Property / cites work @@
+Approximate graph coloring by semidefinite programming
+Normal rank
@@ Property / cites work @@
+Coloring -colorable graphs using relatively small palettes
+Normal rank
@@ Property / cites work @@
+Distributed source coding for satellite communications
+Normal rank
@@ Property / cites work @@
+Improving the performance guarantee for approximate graph coloring
+Normal rank
@@ Property / cites work @@
+On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
+Normal rank