Nearly Optimal NP-Hardness of Unique Coverage (Q5269824): Difference between revisions

@@ Property / cites work @@
+Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply
+Normal rank
@@ Property / cites work @@
+Combination Can Be Hard: Approximability of the Unique Coverage Problem
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Relations between average case complexity and approximation complexity
+Normal rank
@@ Property / cites work @@
+Nearly Optimal NP-Hardness of Unique Coverage
@@ Property / cites work: Nearly Optimal NP-Hardness of Unique Coverage / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+Q2913811
@@ Property / cites work: Q2913811 / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of unique 2-prover 1-round games
@@ Property / cites work: On the power of unique 2-prover 1-round games / rank @@
+Normal rank
@@ Property / cites work @@
+Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank
@@ Property / cites work @@
+Q3549708
@@ Property / cites work: Q3549708 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3191593
@@ Property / cites work: Q3191593 / rank @@
+Normal rank