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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Parameterized complexity: exponential speed-up for planar graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fixed-parameter tractability and approximability of NP optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Amount of Nondeterminism and the Power of Verifying / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of parameterized problems in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of subexponential parameterized algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inapproximability of non-NP-hard optimization problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the efficiency of polynomial time approximation schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Parameterized Upper Bounds for Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Parameterized Approximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On limited nondeterminism and the complexity of the V-C dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4290987 / rank
 
Normal rank

Revision as of 14:23, 2 July 2024

scientific article
Language Label Description Also known as
English
Fixed-parameter approximation: conceptual framework and approximability results
scientific article

    Statements

    Fixed-parameter approximation: conceptual framework and approximability results (English)
    0 references
    0 references
    0 references
    0 references
    23 March 2010
    0 references
    fixed parameter computation
    0 references
    fixed-parameter approximation
    0 references
    fixed-parameter tractability
    0 references
    approximation algorithm
    0 references
    approximation scheme
    0 references

    Identifiers