Polynomial time approximation schemes and parameterized complexity (Q867860): Difference between revisions

@@ Property / author @@
-Jian'er Chen
@@ Property / author: Jian'er Chen / rank @@
-Normal rank
@@ Property / author @@
+Jian'er Chen
@@ Property / author: Jian'er Chen / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2006.04.040
+Normal rank
@@ Property / OpenAlex ID @@
+W2007441033
@@ Property / OpenAlex ID: W2007441033 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Toward a unified approach for the classification of NP-complete optimization problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+On fixed-parameter tractability and approximability of NP optimization problems
+Normal rank
@@ Property / cites work @@
+On the efficiency of polynomial time approximation schemes
+Normal rank
@@ Property / cites work @@
+Characterizing parallel hierarchies by reducibilities
+Normal rank
@@ Property / cites work @@
+A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4474097
@@ Property / cites work: Q4474097 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding first-order properties of locally tree-decomposable structures
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+On Syntactic versus Computational Views of Approximability
+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 @@
+Algorithms for Scheduling Independent Tasks
@@ Property / cites work: Algorithms for Scheduling Independent Tasks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252365
@@ Property / cites work: Q4252365 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:867860