Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 246

The DOI matches its Crossref record.

A tight analysis of the greedy algorithm for set cover

Open access
Slavík, Petr · 1996 · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96

Abstract

We establish significantly improved bounds on the performance of the greedy algorithm for approximating set cover.In particular, we provide the first substantial improvement of the 20 year old classical harmonic upper bound, H(m), of Johnson, Lovssz, and ChvAt al, by showing that the performance ratio of the greedy algorithm is, in fact, exactly in m -in ht m + Q(l), where m is the size of the ground set.The difference between the upper and lower bounds turns out to be less than 1.1.This provides the first tight ansJysis of the greedy algorithm, as well as the first upper bound that lies below H(m) by a function going to infinity with m.We also show that the approximation guarantee for the greedy algorithm is better than the guarantee recently established by Srinivasan for the randomized rounding technique, thus improving the bounds on the integralit~gap.Our improvements result from a new approach which might be generally useful for attacking other similar problems.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/237814.237991

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 246

Metadata

Authors
Slavík, P.
Venue
Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96
Publisher
ACM Press
Published
1996
Pages
435-441
OpenAlex
W1969665089
Cited by
246
References
0
FWCI
1.74
Type
conference paper
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A tight analysis of the greedy algorithm for set cover. https://app.cochat.ai/papers/10.1145/237814.237991
The paper
Slavík, P. (1996). A tight analysis of the greedy algorithm for set cover. Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96. https://doi.org/10.1145/237814.237991

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.