Absolute \(o(\log m)\) error in approximating random set covering: an average case analysis (Q1041744): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / 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: Q5541610 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Preserving approximation in the min-weighted set cover problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximation algorithms for combinatorial problems / 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: Q4228498 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Evaluation of reliability bounds by set covering models. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3824115 / rank | |||
Normal rank |
Latest revision as of 06:38, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Absolute \(o(\log m)\) error in approximating random set covering: an average case analysis |
scientific article |
Statements
Absolute \(o(\log m)\) error in approximating random set covering: an average case analysis (English)
0 references
4 December 2009
0 references
random set covering
0 references
algorithms
0 references
statistical analysis
0 references