The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
Open accessOverview
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
Geometric Algorithms and Combinatorial Optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1988) · Algorithms and Combinatorics · doi:10.1007/978-3-642-97881-4 · Cited by 3,431
Self-citationThe 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-citationSubmodular Functions and Optimization
(2005) · Annals of discrete mathematics · doi:10.1016/s0167-5060(05)x8001-3 · Cited by 1,145
Submodular functions and convexity
Lovász, L. (1983) · Mathematical Programming The State of the Art · doi:10.1007/978-3-642-68874-4_10 · Cited by 964
A Selection Problem of Shared Fixed Costs and Network Flows
Rhys, J. M. W. (1970) · Management Science · doi:10.1287/mnsc.17.3.200 · Cited by 239
Maximal Closure of a Graph and Applications to Combinatorial Problems
Picard, J.-C. (1976) · Management Science · doi:10.1287/mnsc.22.11.1268 · Cited by 234
Submodular Functions and Optimization
(1991) · Annals of discrete mathematics · doi:10.1016/s0167-5060(08)x7004-9 · Cited by 147
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
Iwata, S., Fleischer, L., & Fujishige, S. (2000) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/335305.335317 · Cited by 75
A strongly polynomial-time algorithm for minimizing submodular functions
Iwata, S., Fleischer, L., & Fujishige, S. (1999) · Cited by 24
Cited by
What energy functions can be minimized via graph cuts?
Kolmogorov, V., & Zabih, R. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1262177 · Cited by 3,127
Boros, E., & Hammer, P. L. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00341-9 · Cited by 827
Malicious Data Attacks on the Smart Grid
Kosut, O., Jia, L., Thomas, R. J., & Tong, L. (2011) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2011.2163807 · Cited by 784
A Joint Location-Inventory Model
Shen, Z.-J. M., Coullard, C., & Daskin, M. S. (2003) · Transportation Science · doi:10.1287/trsc.37.1.40.12823 · Cited by 660
Optimal approximation for the submodular welfare problem in the value oracle model
Vondrak, J. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374389 · Cited by 546
Cosegmentation of Image Pairs by Histogram Matching - Incorporating a Global Constraint into MRFs
Rother, C., Minka, T., Blake, A., & Kolmogorov, V. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (CVPR'06) · doi:10.1109/cvpr.2006.91 · Cited by 535
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
Determinantal Point Processes for Machine Learning
Kulesza, A. (2012) · now publishers, Inc. eBooks · doi:10.1561/9781601986290 · Cited by 493
Maximizing Non-monotone Submodular Functions
Feige, U., Mirrokni, V. S., & Vondrák, J. (2011) · SIAM Journal on Computing · doi:10.1137/090779346 · Cited by 452
Malicious Data Attacks on Smart Grid State Estimation: Attack Strategies and Countermeasures
Kosut, O., Jia, L., Thomas, R. J., & Tong, L. (2010) · 2010 First IEEE International Conference on Smart Grid Communications · doi:10.1109/smartgrid.2010.5622045 · Cited by 348
A Linear Programming Approach to Max-Sum Problem: A Review
Werner, T. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1036 · Cited by 342
TimeAware test suite prioritization
Walcott, K. R., Soffa, M. L., Kapfhammer, G. M., & Roos, R. S. (2006) · Proceedings of the 2006 international symposium on Software testing and analysis · doi:10.1145/1146238.1146240 · Cited by 340
Learning with Submodular Functions: A Convex Optimization Perspective
Bach, F. (2013) · now publishers, Inc. eBooks · doi:10.1561/9781601987570 · Cited by 273
On Quadratization of Pseudo-Boolean Functions
Boros, E., & Gruber, A. (2014) · arXiv · doi:10.48550/arxiv.1404.6538 · Cited by 32
Metadata
- Authors
- Schrijver, A.
- Venue
- Journal of Combinatorial Theory, Series B
- Publisher
- Elsevier BV
- Published
- 2000-11
- Volume
- 80
- Issue
- 2
- Pages
- 346-355
- ISSN
- 0095-8956 (ISSN-L)
- OpenAlex
- W2035575256
- Cited by
- 651
- References
- 9
- FWCI
- 18.00
- Type
- journal article
- 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
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.