A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem (Q5091240): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
label / enlabel / en
 
A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.ICALP.2019.81 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Weight Subgraphs and the k-Sum Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Losing Weight by Gaining Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic construction of sets for <i>k</i> -restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential-time approximation of weighted set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical approach to parallel repetition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of fixed parameter clique and dominating set / 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: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of approximating dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inapproximability of \(k\)-dominatingSet for parameterized \(\mathsf{{AC}^0}\) circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of <i>k</i>-B<scp>iclique</scp> / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of the <i>k</i> -Biclique Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Analysis of the Greedy Algorithm for Set Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two combinatorial covering theorems / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964642894 / rank
 
Normal rank
Property / title
 
A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem (English)
Property / title: A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.ICALP.2019.81 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:53, 30 December 2024

scientific article; zbMATH DE number 7561574
Language Label Description Also known as
English
A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem
scientific article; zbMATH DE number 7561574

    Statements

    0 references
    21 July 2022
    0 references
    set cover
    0 references
    FPT inapproximability
    0 references
    gap-producing reduction
    0 references
    \((n,k)\)-universal set
    0 references
    0 references
    0 references
    0 references
    0 references
    A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem (English)
    0 references

    Identifiers