Fixed-parameter approximation: conceptual framework and approximability results (Q2379929): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-008-9223-x
@@ Property / DOI: 10.1007/s00453-008-9223-x / rank @@
-Normal rank
@@ Property / author @@
+Li-Ming Cai
@@ Property / author: Li-Ming Cai / 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.1007/s00453-008-9223-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2157124529
@@ Property / OpenAlex ID: W2157124529 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity: exponential speed-up for planar graph problems
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+On fixed-parameter tractability and approximability of NP optimization problems
+Normal rank
@@ Property / cites work @@
+On the Amount of Nondeterminism and the Power of Verifying
+Normal rank
@@ Property / cites work @@
+On the structure of parameterized problems in NP
@@ Property / cites work: On the structure of parameterized problems in NP / rank @@
+Normal rank
@@ Property / cites work @@
+On the existence of subexponential parameterized algorithms
+Normal rank
@@ Property / cites work @@
+The inapproximability of non-NP-hard optimization problems.
+Normal rank
@@ Property / cites work @@
+On the efficiency of polynomial time approximation schemes
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Parameterized Upper Bounds for Vertex Cover
+Normal rank
@@ Property / cites work @@
+Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems
+Normal rank
@@ Property / cites work @@
+On Parameterized Approximability
@@ Property / cites work: On Parameterized Approximability / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability and Completeness I: Basic Results
+Normal rank
@@ Property / cites work @@
+Parameterized Approximation Problems
@@ Property / cites work: Parameterized Approximation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4259986
@@ Property / cites work: Q4259986 / 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 @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+On limited nondeterminism and the complexity of the V-C dimension
+Normal rank
@@ Property / cites work @@
+Q4290987
@@ Property / cites work: Q4290987 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00453-008-9223-X
@@ Property / DOI: 10.1007/S00453-008-9223-X / rank @@
+Normal rank