Parameterized exact and approximation algorithms for maximum<i>k</i>-set cover and related satisfiability problems (Q2956881): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4263699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating low-dimensional coverage problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning via Inclusion-Exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing small partial coverings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Approximation: Conceptual Framework and Approximability Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turing way to parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Parameterized Approximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized approximation of dominating set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: W-hierarchies defined by symmetric gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of Vertex Cover variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chamberlin--Courant Rule with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time / rank
 
Normal rank

Revision as of 07:25, 13 July 2024

scientific article
Language Label Description Also known as
English
Parameterized exact and approximation algorithms for maximum<i>k</i>-set cover and related satisfiability problems
scientific article

    Statements

    Parameterized exact and approximation algorithms for maximum<i>k</i>-set cover and related satisfiability problems (English)
    0 references
    0 references
    0 references
    0 references
    19 January 2017
    0 references
    parameterized complexity
    0 references
    parameterized approximation
    0 references
    max k-set cover
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references