Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP (Q3374757): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2569714044
@@ Property / OpenAlex ID: W2569714044 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+cs/0110025
@@ Property / arXiv ID: cs/0110025 / rank @@
+Normal rank
@@ Property / cites work @@
+It is hard to know when greedy is good for finding independent sets
+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 @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040797
@@ Property / cites work: Q4040797 / rank @@
+Normal rank
@@ Property / cites work @@
+The strong exponential hierarchy collapses
@@ Property / cites work: The strong exponential hierarchy collapses / rank @@
+Normal rank
@@ Property / cites work @@
+Q4536344
@@ Property / cites work: Q4536344 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact analysis of Dodgson elections
@@ Property / cites work: Exact analysis of Dodgson elections / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP
+Normal rank
@@ Property / cites work @@
+The complexity of Kemeny elections
@@ Property / cites work: The complexity of Kemeny elections / rank @@
+Normal rank
@@ Property / cites work @@
+The Minimization Problem for Boolean Formulas
@@ Property / cites work: The Minimization Problem for Boolean Formulas / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+\(P^{NP[O(\log n)]}\) and sparse turing-complete sets for NP
+Normal rank
@@ Property / cites work @@
+The complexity of optimization problems
@@ Property / cites work: The complexity of optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+The difference and truth-table hierarchies for NP
@@ Property / cites work: The difference and truth-table hierarchies for NP / rank @@
+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 @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4743737
@@ Property / cites work: Q4743737 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of the exact domatic number problem and of the exact conveyor flow shop problem
+Normal rank
@@ Property / cites work @@
+Exact complexity of the winner problem for Young elections
+Normal rank
@@ Property / cites work @@
+Q4472458
@@ Property / cites work: Q4472458 / rank @@
+Normal rank
@@ Property / cites work @@
+More complicated questions about maxima and minima, and some closures of NP
+Normal rank
@@ Property / cites work @@
+Bounded Query Classes
@@ Property / cites work: Bounded Query Classes / rank @@
+Normal rank