Submodular functions and electrical networks
From MaRDI portal
Publication:1359940
zbMath0921.05021MaRDI QIDQ1359940
Publication date: 9 July 1997
Published in: Annals of Discrete Mathematics (Search for Journal in Brave)
Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Applications of graph theory to circuits and networks (94C15)
Related Items (38)
Disjunctive analogues of submodular and supermodular pseudo-Boolean functions ⋮ Realizing symmetric set functions as hypergraph cut capacity ⋮ Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation ⋮ A faster algorithm for computing the principal sequence of partitions of a graph ⋮ Structural identifiability in low-rank matrix factorization ⋮ The Expressive Power of Binary Submodular Functions ⋮ A port-Hamiltonian formulation of physical switching systems with varying constraints ⋮ Supermodular functions and the complexity of MAX CSP ⋮ Submodular learning and covering with response-dependent costs ⋮ A note on the implications of approximate submodularity in discrete optimization ⋮ A subspace approach to linear dynamical systems ⋮ The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function. ⋮ A note on the minimization of symmetric and general submodular functions ⋮ Improving graph partitions using submodular functions. ⋮ Theory of Principal Partitions Revisited ⋮ Recent Developments in Discrete Convex Analysis ⋮ Higher dimensional electrical circuits ⋮ The Expressive Power of Valued Constraints: Hierarchies and Collapses ⋮ On complete versions of Thevenin-Norton and maximum power transfer theorems ⋮ Tractability index of hybrid equations for circuit simulation ⋮ Adhesivity of polymatroids ⋮ Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms ⋮ The Submodular Secretary Problem Goes Linear ⋮ Graph cuts with interacting edge weights: examples, approximations, and algorithms ⋮ On the notion of generalized minor in topological network theory and matroids ⋮ Sublattices of product spaces: Hulls, representations and counting ⋮ The expressive power of valued constraints: Hierarchies and collapses ⋮ Algebraic and topological closure conditions for classes of pseudo-Boolean functions ⋮ The expressive power of binary submodular functions ⋮ Hybrid port--Hamiltonian systems: from parameterized incidence matrices to hybrid automata ⋮ Log-supermodularity of weight functions, ordering weighted losses, and the loading monotonicity of weighted premiums ⋮ Combinatorial auctions with decreasing marginal utilities ⋮ Some applications of an Implicit Duality Theorem to connections of structures of special types including Dirac and reciprocal structures. ⋮ Transforming a graph into a 1-balanced graph ⋮ Minimization of locally defined submodular functions by optimal soft arc consistency ⋮ Minimizing symmetric submodular functions ⋮ A note on optimal covering augmentation for graphic polymatroids. ⋮ Bimonotone linear inequalities and sublattices of \(\mathbb R^n\)
This page was built for publication: Submodular functions and electrical networks
