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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a unified approach for the classification of NP-complete optimization problems / 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: On fixed-parameter tractability and approximability of NP 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: Characterizing parallel hierarchies by reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding first-order properties of locally tree-decomposable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Syntactic versus Computational Views of Approximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non deterministic polynomial optimization problems and their approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252365 / rank
 
Normal rank

Latest revision as of 14:55, 25 June 2024

scientific article
Language Label Description Also known as
English
Polynomial time approximation schemes and parameterized complexity
scientific article

    Statements

    Polynomial time approximation schemes and parameterized complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 February 2007
    0 references
    0 references
    approximation algorithm
    0 references
    polynomial time approximation scheme
    0 references
    parameterized complexity
    0 references
    W-hierarchy
    0 references
    0 references