Decomposition of submodular functions
From MaRDI portal
Cites work
- 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?)
- A Combinatorial Decomposition Theory
- Connectivity in Matroids
- Decomposition of Directed Graphs
- Multi-Terminal Network Flows
- The Partial Order of a Polymatroid Extreme Point
- The ellipsoid method and its consequences in combinatorial optimization
Cited in
(15)- On Submodular Search and Machine Scheduling
- Decomposition of 3-connected cubic graphs
- Tree-representation of set families and applications to combinatorial decompositions
- Minimum cuts and sparsification in hypergraphs
- Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\)
- Set function optimization
- Minimizing symmetric submodular functions
- Graph cuts with interacting edge weights: examples, approximations, and algorithms
- Some excluded-minor theorems for a class of polymatroids
- Decomposition of k-ary relations
- Decomposition of partial orders
- On submodular function minimization
- Connectivity of submodular functions
- The search value of a set
- Unavoidable minors for connected 2-polymatroids
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)
