Randomized approximation for the set multicover problem in hypergraphs (Q262245): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Homogeneous Weights for Approximating the Partial Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks / 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: An approximation algorithm for the partial vertex cover problem in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomised approximation algorithm for the hitting set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Maximization Problems Arising in Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for partial covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic methods for algorithmic discrete mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast approximation algorithm for the multicovering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum graph partitioning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Set Covering in Uniform Hypergraphs / 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: Randomized approximation of bounded multicovering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank
 
Normal rank

Latest revision as of 16:07, 11 July 2024

scientific article
Language Label Description Also known as
English
Randomized approximation for the set multicover problem in hypergraphs
scientific article

    Statements

    Randomized approximation for the set multicover problem in hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 March 2016
    0 references
    combinatorial optimization
    0 references
    approximation algorithms
    0 references
    randomized algorithm
    0 references
    hypergraphs
    0 references
    set cover
    0 references
    set multicover
    0 references
    0 references

    Identifiers

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