The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Submodular functions and convexity
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.
Integrity signals
Registry
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.
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
Choquet, G. (1954) · Annales de l'Institut Fourier · doi:10.5802/aif.53 · Cited by 4,204
The ellipsoid method and its consequences in combinatorial optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1981) · Combinatorica · doi:10.1007/bf02579273 · Cited by 2,011
Self-citationAn analysis of approximations for maximizing submodular set functions—II
Fisher, M. L., Nemhauser, G. L., & Wolsey, L. A. (1978) · Mathematical Programming Studies · doi:10.1007/bfb0121195 · Cited by 589
On Generic Rigidity in the Plane
Lovász, L., & Yemini, Y. (1982) · SIAM Journal on Algebraic Discrete Methods · doi:10.1137/0603009 · Cited by 271
Self-citationMATROIDS AND SUBMODULAR FUNCTIONS
Dunstan, F. (1976) · The Quarterly Journal of Mathematics · doi:10.1093/qmath/27.3.339 · Cited by 40
Cited by
Boros, E., & Hammer, P. L. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00341-9 · Cited by 827
Quantum machine learning: a classical perspective
Ciliberto, C., Herbster, M., Ialongo, A. D., Pontil, M., Rocchetto, A., Severini, S., & Wossnig, L. (2018) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2017.0551 · Cited by 518
Metadata
- Authors
- Lovász, L.
- Venue
- Mathematical Programming The State of the Art
- Publisher
- Springer Berlin Heidelberg
- Published
- 1983
- Pages
- 235-257
- OpenAlex
- W1498671329
- Cited by
- 964
- References
- 5
- FWCI
- 15.91
- Type
- book chapter
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Submodular functions and convexity. https://app.cochat.ai/papers/10.1007/978-3-642-68874-4_10
- The paper
- Lovász, L. (1983). Submodular functions and convexity. Mathematical Programming The State of the Art. https://doi.org/10.1007/978-3-642-68874-4_10
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.
