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

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

A Greedy Heuristic for the Set-Covering Problem

Chvatal, V. · 1979 · Mathematics of Operations Research

Abstract

Let A be a binary matrix of size m × n, let c T be a positive row vector of length n and let e be the column vector, all of whose m components are ones. The set-covering problem is to minimize c T x subject to Ax ≥ e and x binary. We compare the value of the objective function at a feasible solution found by a simple greedy heuristic to the true optimum. It turns out that the ratio between the two grows at most logarithmically in the largest column sum of A. When all the components of c T are the same, our result reduces to a theorem established previously by Johnson and Lovasz.

Overview

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1287/moor.4.3.233

Cites

5 of 5 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Cites

Cited by

See all 2,581

Metadata

Authors
Chvatal, V.
Venue
Mathematics of Operations Research
Published
1979-08
Volume
4
Issue
3
Pages
233-235
ISSN
  • 0364-765X (ISSN-L)
  • 1526-5471
OpenAlex
W2157054705
Cited by
2,581
References
5
FWCI
7.83
Type
journal article
Language
en
Open access
closed

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

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.