Structure of polynomial-time approximation (Q692893): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00224-011-9366-z
+Normal rank
@@ Property / OpenAlex ID @@
+W1971077453
@@ Property / OpenAlex ID: W1971077453 / rank @@
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+On fixed-parameter tractability and approximability of NP optimization problems
+Normal rank
@@ Property / cites work @@
+The complexity of polynomial-time approximation
@@ Property / cites work: The complexity of polynomial-time approximation / rank @@
+Normal rank
@@ Property / cites work @@
+On the existence of subexponential parameterized algorithms
+Normal rank
@@ Property / cites work @@
+On the efficiency of polynomial time approximation schemes
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes and parameterized complexity
+Normal rank
@@ Property / cites work @@
+ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS
@@ Property / cites work: ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS / rank @@
+Normal rank
@@ Property / cites work @@
+Q3933762
@@ Property / cites work: Q3933762 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for extensible bin packing
+Normal rank
@@ Property / cites work @@
+Structure in Approximation Classes
@@ Property / cites work: Structure in Approximation Classes / rank @@
+Normal rank
@@ Property / cites work @@
+Completeness in approximation classes
@@ Property / cites work: Completeness in approximation classes / rank @@
+Normal rank
@@ Property / cites work @@
+On approximation scheme preserving reducibility and its applications
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
+Normal rank
@@ Property / cites work @@
+Approximating the Minimum-Degree Steiner Tree to within One of Optimal
+Normal rank
@@ Property / cites work @@
+`` Strong '' NP-Completeness Results
@@ Property / cites work: `` Strong '' NP-Completeness Results / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2004
@@ Property / cites work: Mathematical Foundations of Computer Science 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+On Syntactic versus Computational Views of Approximability
+Normal rank
@@ Property / cites work @@
+Logical definability of NP optimization problems
@@ Property / cites work: Logical definability of NP optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation properties of NP minimization classes
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of Independence and Domination on Geometric Graphs
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Non deterministic polynomial optimization problems and their approximations
+Normal rank
@@ Property / cites work @@
+The hardness of approximation: Gap location
@@ Property / cites work: The hardness of approximation: Gap location / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds for Assembly Line Balancing Heuristics
@@ Property / cites work: Bounds for Assembly Line Balancing Heuristics / rank @@
+Normal rank
@@ Property / cites work @@
+On Approximate Solutions for Combinatorial Optimization Problems
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Better Approximation Schemes for Disk Graphs
@@ Property / cites work: Better Approximation Schemes for Disk Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+There is no asymptotic PTAS for two-dimensional vector packing
+Normal rank