Approximating Independent Set and Coloring in Random Uniform Hypergraphs (Q3599156): Difference between revisions

@@ Property / cites work @@
+Approximating Maximum Clique by Removing Subgraphs
+Normal rank
@@ Property / cites work @@
+Approximations of Weighted Independent Set and Hereditary Subset Problems
+Normal rank
@@ Property / cites work @@
+A still better performance guarantee for approximate graph coloring
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Q4218130
@@ Property / cites work: Q4218130 / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the independence number and the chromatic number in expected polynomial time
+Normal rank
@@ Property / cites work @@
+Approximate coloring of uniform hypergraphs
@@ Property / cites work: Approximate coloring of uniform hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5514782
@@ Property / cites work: Q5514782 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for metric facility location and             <i>k</i>             -Median problems using the primal-dual schema and Lagrangian relaxation
+Normal rank
@@ Property / cites work @@
+Linear degree extractors and the inapproximability of max clique and chromatic number
+Normal rank