On the complexity of approximating the independent set problem (Q5096160): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / cites work @@
+Q4133133
@@ Property / cites work: Q4133133 / rank @@
+Normal rank
@@ Property / cites work @@
+Structure preserving reductions among convex optimization problems
+Normal rank
@@ Property / cites work @@
+Toward a unified approach for the classification of NP-complete optimization problems
+Normal rank
@@ Property / cites work @@
+A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
+Normal rank
@@ Property / cites work @@
+Q4065548
@@ Property / cites work: Q4065548 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5538132
@@ Property / cites work: Q5538132 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+The Complexity of Some Problems on Subsequences and Supersequences
+Normal rank
@@ Property / cites work @@
+Q3219752
@@ Property / cites work: Q3219752 / rank @@
+Normal rank
@@ Property / cites work @@
+Non deterministic polynomial optimization problems and their approximations
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bfb0028990
+Normal rank
@@ Property / OpenAlex ID @@
+W1510300750
@@ Property / OpenAlex ID: W1510300750 / rank @@
+Normal rank