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
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.
Integrity signals
Registry
Cites
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.
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
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Nemhauser, G. L., & Wolsey, L. A. (1972) · Cited by 3,365
Reducibility Among Combinatorial Problems
Karp, R. M. (2010) · 50 Years of Integer Programming 1958-2008 · doi:10.1007/978-3-540-68279-0_8 · Cited by 2,490
Approximation algorithms for combinatorial problems
Johnson, D. S. (1974) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(74)80044-9 · Cited by 2,197
On the ratio of optimal integral and fractional covers
Lovász, L. (1975) · Discrete Mathematics · doi:10.1016/0012-365x(75)90058-8 · Cited by 1,114
Cited by
Droplet barcoding for single-cell transcriptomics applied to embryonic stem cells
Klein, A. M., Mazutis, L., Akartuna, I., Tallapragada, N., Veres, A., Li, V., Peshkin, L., Weitz, D. A., & Kirschner, M. W. (2015) · Cell · doi:10.1016/j.cell.2015.04.044 · Cited by 3,356
A threshold of ln n for approximating set cover
Feige, U. (1998) · Journal of the ACM · doi:10.1145/285055.285059 · Cited by 3,086
A Formal Analysis and Taxonomy of Task Allocation in Multi-Robot Systems
Gerkey, B. P., & Matarić, M. J. (2004) · The International Journal of Robotics Research · doi:10.1177/0278364904045564 · Cited by 1,753
The Design of Approximation Algorithms
Williamson, D. P., & Shmoys, D. B. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921735 · Cited by 1,301
McAlister, G. C., Nusinow, D. P., Jedrychowski, M. P., Wühr, M., Huttlin, E. L., Erickson, B. K., Rad, R., Haas, W., & Gygi, S. P. (2014) · Analytical Chemistry · doi:10.1021/ac502040v · Cited by 1,263
Bomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_1 · Cited by 1,148
Methods for task allocation via agent coalition formation
Shehory, O., & Kraus, S. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(98)00045-9 · Cited by 1,080
A probabilistic heuristic for a computationally difficult set covering problem
Feo, T. A., & Resende, M. G. C. (1989) · Operations Research Letters · doi:10.1016/0167-6377(89)90002-3 · Cited by 1,065
On the hardness of approximating minimization problems
Lund, C., & Yannakakis, M. (1994) · Journal of the ACM · doi:10.1145/185675.306789 · Cited by 872
A survey of multi-agent organizational paradigms
HORLING, B., & LESSER, V. (2004) · The Knowledge Engineering Review · doi:10.1017/s0269888905000317 · Cited by 709
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks
Wan, P.-J., Alzoubi, K. M., & Frieder, O. (2004) · Mobile Networks and Applications · doi:10.1023/b:mone.0000013625.87793.13 · Cited by 657
Distributed construction of connected dominating set in wireless ad hoc networks
Wan, P.-J., Alzoubi, K. M., & Frieder, O. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019411 · Cited by 628
Korte, B., & Vygen, J. (2000) · Algorithms and Combinatorics · doi:10.1007/978-3-662-21708-5_16 · Cited by 579
Biodiversity Conservation Planning Tools: Present Status and Challenges for the Future
Sarkar, S., Pressey, R. L., Faith, D. P., Margules, C. R., Fuller, T., Stoms, D. M., Moffett, A., Wilson, K. A., Williams, K. J., Williams, P. H., et al. (2006) · Annual Review of Environment and Resources · doi:10.1146/annurev.energy.31.042606.085844 · Cited by 559
Learning Boolean concepts in the presence of many irrelevant features
Almuallim, H., & Dietterich, T. G. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90084-1 · Cited by 520
Reachability and Distance Queries via 2-Hop Labels
Cohen, E., Halperin, E., Kaplan, H., & Zwick, U. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539702403098 · Cited by 518
Computational limitations on learning from examples
Pitt, L., & Valiant, L. G. (1988) · Journal of the ACM · doi:10.1145/48014.63140 · Cited by 515
CrowdER: crowdsourcing entity resolution
Wang, J., Kraska, T., Franklin, M. J., & Feng, J. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2350229.2350263 · Cited by 507
Approximation Algorithms for the Set Covering and Vertex Cover Problems
Hochbaum, D. S. (1982) · SIAM Journal on Computing · doi:10.1137/0211045 · Cited by 506
Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
Haussler, D. (1988) · Artificial Intelligence · doi:10.1016/0004-3702(88)90002-1 · Cited by 479
Negotiation and cooperation in multi-agent environments
Kraus, S. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00025-8 · Cited by 451
Almost optimal set covers in finite VC-dimension
Brönnimann, H., & Goodrich, M. T. (1995) · Discrete & Computational Geometry · doi:10.1007/bf02570718 · Cited by 441
A linear-time approximation algorithm for the weighted vertex cover problem
Bar-Yehuda, R., & Even, S. (1981) · Journal of Algorithms · doi:10.1016/0196-6774(81)90020-1 · Cited by 430
A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem
Bar-Yehuda, R., & Even, S. (1985) · North-Holland Mathematics Studies · doi:10.1016/s0304-0208(08)73101-3 · Cited by 404
A study of effective regression testing in practice
Wong, W. E., Horgan, J. R., London, S., & Agrawal, H. (2002) · Proceedings The Eighth International Symposium on Software Reliability Engineering · doi:10.1109/issre.1997.630875 · Cited by 390
Pardalos, P. M., & Xue, J. (1994) · Journal of Global Optimization · doi:10.1007/bf01098364 · Cited by 382
Learning in the Presence of Malicious Errors
Kearns, M., & Li, M. (1993) · SIAM Journal on Computing · doi:10.1137/0222052 · Cited by 340
Potential Function Methods for Approximately Solving Linear Programming Problems
(2002) · International Series in Operations Research & Management Science · doi:10.1007/b115460 · Cited by 291
Fast shortest path distance estimation in large networks
Potamias, M., Bonchi, F., Castillo, C., & Gionis, A. (2009) · Proceedings of the 18th ACM conference on Information and knowledge management · doi:10.1145/1645953.1646063 · Cited by 291
Mutation-Driven Generation of Unit Tests and Oracles
Fraser, G., & Zeller, A. (2012) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2011.93 · Cited by 283
Gaidzik, V. I., Teleanu, V, Papaemmanuil, E., Weber, D., Paschka, P., Hahn, J., Wallrabenstein, T., Kolbinger, B., Köhne, C. H., Horst, H. A., et al. (2016) · Leukemia · doi:10.1038/leu.2016.126 · Cited by 279
Multi-robot coalition formation
Vig, L., & Adams, J. A. (2006) · IEEE Transactions on Robotics · doi:10.1109/tro.2006.878948 · Cited by 275
On the learnability of discrete distributions
Kearns, M., Mansour, Y., Ron, D., Rubinfeld, R., Schapire, R. E., & Sellie, L. (1994) · Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 · doi:10.1145/195058.195155 · Cited by 273
Korte, B., & Vygen, J. (2002) · Algorithms and Combinatorics · doi:10.1007/978-3-662-21711-5_16 · Cited by 273
Database Repairing and Consistent Query Answering
Bertossi, L. (2011) · Synthesis Lectures on Data Management · doi:10.1007/978-3-031-01883-1 · Cited by 262
The Design of Competitive Online Algorithms via a Primal—Dual Approach
Buchbinder, N., & (Seffi) Naor, J. (2009) · now publishers, Inc. eBooks · doi:10.1561/9781601982179 · Cited by 260
Fast Reconstruction of Compact Context-Specific Metabolic Network Models
Vlassis, N., Pacheco, M. P., & Sauter, T. (2014) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1003424 · Cited by 258
Goldman, S. A., & Kearns, M. J. (1995) · Journal of Computer and System Sciences · doi:10.1006/jcss.1995.1003 · Cited by 257
Deep Proteomics of the Xenopus laevis Egg using an mRNA-Derived Reference Database
Wühr, M., Freeman, R. M., Presler, M., Horb, M. E., Peshkin, L., Gygi, S. P., & Kirschner, M. W. (2014) · Current Biology · doi:10.1016/j.cub.2014.05.044 · Cited by 256
Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
Fisher, M. L., & Kedia, P. (1990) · Management Science · doi:10.1287/mnsc.36.6.674 · Cited by 253
GZoltar: an eclipse plug-in for testing and debugging
Campos, J., Riboira, A., Perez, A., & Abreu, R. (2012) · Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering · doi:10.1145/2351676.2351752 · Cited by 208
“Other techniques for regression testing include Greedy heuristic [6] and Program Slicing [9].”
MethodGreedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
Koufogiannakis, C., & Young, N. E. (2013) · Algorithmica · doi:10.1007/s00453-012-9629-3 · Cited by 53
“Examples include a greedy algorithm for set cover [35,42,17] (1975) and greedy O(log maxj ∑ iAij)-approximation algorithms for CIP with {0, 1}-variables and integer A [22,24] (1982).”
MethodBabbush, R., Perdomo‐Ortiz, A., O'Gorman, B., Macready, W., & Aspuru‐Guzik, A. (2014) · Advances in Chemical Physics · doi:10.1002/9781118755815.ch05 · Cited by 45
Unsupervised tip-mining from customer reviews
Zhu, D., Lappas, T., & Zhang, J. (2018) · Decision Support Systems · doi:10.1016/j.dss.2018.01.011 · Cited by 32
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.