Decomposition of submodular functions
From MaRDI portal
Publication:1053717
DOI10.1007/BF02579341zbMath0518.05059OpenAlexW2118220538MaRDI QIDQ1053717
Publication date: 1983
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579341
decomposition algorithmssubmodular functionsunique decompositionhypergraph functionsnetwork functions
Hypergraphs (05C65) Circuits, networks (94C99) Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99) Discrete mathematics in relation to computer science (68R99)
Related Items (14)
On submodular function minimization ⋮ Minimum Cuts and Sparsification in Hypergraphs ⋮ On Submodular Search and Machine Scheduling ⋮ Tree-representation of set families and applications to combinatorial decompositions ⋮ The search value of a set ⋮ Decomposition of partial orders ⋮ Graph cuts with interacting edge weights: examples, approximations, and algorithms ⋮ Decomposition of 3-connected cubic graphs ⋮ Connectivity of submodular functions ⋮ Decomposition of k-ary relations ⋮ Set function optimization ⋮ Minimizing symmetric submodular functions ⋮ Unavoidable minors for connected 2-polymatroids ⋮ Some excluded-minor theorems for a class of polymatroids
Cites Work
This page was built for publication: Decomposition of submodular functions