Q5091240 (Q5091240): Difference between revisions

@@ Property / cites work @@
+Exact Weight Subgraphs and the k-Sum Conjecture
@@ Property / cites work: Exact Weight Subgraphs and the k-Sum Conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Losing Weight by Gaining Edges
@@ Property / cites work: Losing Weight by Gaining Edges / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic construction of sets for             <i>k</i>             -restrictions
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+A Greedy Heuristic for the Set-Covering Problem
@@ Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential-time approximation of weighted set cover
+Normal rank
@@ Property / cites work @@
+Analytical approach to parallel repetition
@@ Property / cites work: Analytical approach to parallel repetition / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of fixed parameter clique and dominating set
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Extremal Combinatorics
@@ Property / cites work: Extremal Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of approximating dominating set
+Normal rank
@@ Property / cites work @@
+The inapproximability of \(k\)-dominatingSet for parameterized \(\mathsf{{AC}^0}\) circuits
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of <i>k</i>-B<scp>iclique</scp>
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of the             <i>k</i>             -Biclique Problem
+Normal rank
@@ Property / cites work @@
+On the ratio of optimal integral and fractional covers
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank
@@ Property / cites work @@
+Q5417690
@@ Property / cites work: Q5417690 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4527015
@@ Property / cites work: Q4527015 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5302097
@@ Property / cites work: Q5302097 / rank @@
+Normal rank
@@ Property / cites work @@
+A Tight Analysis of the Greedy Algorithm for Set Cover
+Normal rank
@@ Property / cites work @@
+Two combinatorial covering theorems
@@ Property / cites work: Two combinatorial covering theorems / rank @@
+Normal rank