On the public citation graph

Decomposition of submodular functions

https://doi.org/10.1007/bf02579341
0 signed · 50 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1016/0095-8956(84)90023-6openalex-snapshot
Testing membership in matroid polyhedra
inferredcites →https://doi.org/10.1016/0166-218x(83)90040-9openalex-snapshot
Canonical decompositions of symmetric submodular systems
inferredcites →https://doi.org/10.1090/surv/204/02openalex-snapshot
Combinatorial structures
inferredcites →https://doi.org/10.1137/0109047openalex-snapshot
Multi-Terminal Network Flows
inferredcites →https://doi.org/10.1137/0603021openalex-snapshot
Decomposition of Directed Graphs
inferredcites →https://doi.org/10.4153/cjm-1966-129-2openalex-snapshot
Connectivity in Matroids
inferredcites →https://doi.org/10.4153/cjm-1980-057-7openalex-snapshot
A Combinatorial Decomposition Theory

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-10596-8_12openalex-snapshot
Nonsubmodular Optimization
inferred← citeshttps://doi.org/10.1007/bf00346130openalex-snapshot
Decomposition of partial orders
inferred← citeshttps://doi.org/10.1007/bf01303518openalex-snapshot
Some excluded-minor theorems for a class of polymatroids
inferred← citeshttps://doi.org/10.1007/bf01585863openalex-snapshot
Minimizing symmetric submodular functions
inferred← citeshttps://doi.org/10.1007/bf02579361openalex-snapshot
On submodular function minimization
inferred← citeshttps://doi.org/10.1007/s10107-016-1038-yopenalex-snapshot
Graph cuts with interacting edge weights: examples, approximations, and algorithms
inferred← citeshttps://doi.org/10.1007/s10107-023-02013-8openalex-snapshot
Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k
inferred← citeshttps://doi.org/10.1007/s101070050032openalex-snapshot
Edge-augmentation of hypergraphs
inferred← citeshttps://doi.org/10.1007/s101070050034openalex-snapshot
Covering symmetric supermodular functions by graphs
inferred← citeshttps://doi.org/10.1007/s101070050035openalex-snapshot
Coverings and structure of crossing families
inferred← citeshttps://doi.org/10.1007/s10479-016-2252-yopenalex-snapshot
The search value of a set
inferred← citeshttps://doi.org/10.1007/s40305-018-0233-3openalex-snapshot
Set Function Optimization
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90067-ropenalex-snapshot
Decomposition of k-ary relations
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90140-bopenalex-snapshot
Connectivity of submodular functions
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90365-zopenalex-snapshot
Decomposition of 3-connected cubic graphs
inferred← citeshttps://doi.org/10.1016/j.aam.2012.10.001openalex-snapshot
Essential elements in connected k-polymatroids
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.032openalex-snapshot
Tree-representation of set families and applications to combinatorial decompositions
inferred← citeshttps://doi.org/10.1016/j.ejor.2025.10.020openalex-snapshot
Maximizing positive influence of live-campaign promotion in live social E-commerce networks
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.03.005openalex-snapshot
Unavoidable minors for connected 2-polymatroids
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115513openalex-snapshot
Target influence maximization problem under avoiding unexpected users interruption in online social network
inferred← citeshttps://doi.org/10.1016/s0167-5060(05)80010-xopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70131-6openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12007-6openalex-snapshot
Submodular Function Minimization
inferred← citeshttps://doi.org/10.1109/tit.2021.3123944openalex-snapshot
Generalized Submodular Information Measures: Theoretical Properties, Examples, Optimization Algorithms, and Applications
inferred← citeshttps://doi.org/10.1137/1.9781611974782.70openalex-snapshot
Computing minimum cuts in hypergraphs
inferred← citeshttps://doi.org/10.1137/18m1163865openalex-snapshot
Minimum Cuts and Sparsification in Hypergraphs
inferred← citeshttps://doi.org/10.1145/3618260.3649753openalex-snapshot
Hypergraph Unreliability in Quasi-Polynomial Time
inferred← citeshttps://doi.org/10.1201/b19163-19openalex-snapshot
Graph Connectivity Augmentation
inferred← citeshttps://doi.org/10.1287/moor.2018.0978openalex-snapshot
On Submodular Search and Machine Scheduling
inferred← citeshttps://doi.org/10.1609/aaai.v35i14.17465openalex-snapshot
Submodular Span, with Applications to Conditional Data Summarization
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.1516openalex-snapshot
On Matroid and Polymatroid Connectivity
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.2openalex-snapshot
Combinatorial Optimization Algorithms via Polymorphisms
inferred← citeshttps://doi.org/10.48550/arxiv.1207.0560openalex-snapshot
Algorithms for Approximate Minimization of the Difference Between Submodular Functions, with Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1308.5275openalex-snapshot
The Lovasz-Bregman Divergence and connections to rank aggregation, clustering, and web ranking
inferred← citeshttps://doi.org/10.48550/arxiv.1311.2106openalex-snapshot
Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1311.2110openalex-snapshot
Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1402.0240openalex-snapshot
Graph Cuts with Interacting Edge Costs - Examples, Approximations, and Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1408.2062openalex-snapshot
The Lovasz-Bregman Divergence and connections to rank aggregation, clustering, and web ranking
inferred← citeshttps://doi.org/10.48550/arxiv.1905.13492openalex-snapshot
Majorisation-minimisation algorithms for minimising the difference between lattice submodular functions
inferred← citeshttps://doi.org/10.48550/arxiv.2006.15412openalex-snapshot
Submodular Combinatorial Information Measures with Applications in Machine Learning
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0603108openalex-snapshot
Minimizing Symmetric Set Functions Faster
inferred← citeshttps://doi.org/10.5555/313651.313669openalex-snapshot
A combinatorial algorithm for minimizing symmetric submodular functions
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.