Uniform unweighted set cover: the power of non-oblivious local search (Q631761): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Survey of Approximation Results for Local Search Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Local Search for Weighted <i>k</i>-Set Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs / 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: Q4526990 / 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: A modified greedy heuristic for the set covering problem with improved worst case bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering the Edges of Bipartite Graphs Using K 2,2 Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / 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: Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search / 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: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Analysis of the Greedy Algorithm for Set Cover / rank
 
Normal rank

Latest revision as of 20:35, 3 July 2024

scientific article
Language Label Description Also known as
English
Uniform unweighted set cover: the power of non-oblivious local search
scientific article

    Statements

    Uniform unweighted set cover: the power of non-oblivious local search (English)
    0 references
    0 references
    0 references
    14 March 2011
    0 references
    approximation algorithms
    0 references
    set cover
    0 references
    local search
    0 references
    unweighted set cover problem
    0 references
    unweighted \(k\)-set cover problem
    0 references

    Identifiers

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