Decomposition of submodular functions
From MaRDI portal
Cites work
- A Combinatorial Decomposition Theory
- Connectivity in Matroids
- Decomposition of Directed Graphs
- scientific article; zbMATH DE number 3749025 (Why is no real title available?)
- scientific article; zbMATH DE number 3236772 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Multi-Terminal Network Flows
- The ellipsoid method and its consequences in combinatorial optimization
- The Partial Order of a Polymatroid Extreme Point
Cited in
(18)- On submodular function minimization
- Connectivity of submodular functions
- Minimizing symmetric submodular functions
- Some excluded-minor theorems for a class of polymatroids
- The search value of a set
- Set function optimization
- Unavoidable minors for connected 2-polymatroids
- Tree-representation of set families and applications to combinatorial decompositions
- Minimum cuts and sparsification in hypergraphs
- On Submodular Search and Machine Scheduling
- Graph cuts with interacting edge weights: examples, approximations, and algorithms
- Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k
- Decomposition of 3-connected cubic graphs
- Target influence maximization problem under avoiding unexpected users interruption in online social network
- Submodular combinatorial information measures with applications in machine learning
- Maximizing positive influence of live-campaign promotion in live social e-commerce networks
- Decomposition of k-ary relations
- Decomposition of partial orders
This page was built for publication: Decomposition of submodular functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1053717)