Hypergraphic submodular function minimization
From MaRDI portal
Publication:393937
DOI10.1016/j.disc.2013.08.008zbMath1280.05128OpenAlexW2093632543MaRDI QIDQ393937
Publication date: 24 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.08.008
Hypergraphs (05C65) Deterministic network models in operations research (90B10) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- A push-relabel framework for submodular function minimization and applications to parametric optimization
- Trees and Cuts
- Optimal attack and reinforcement of a network
- A new approach to the maximum-flow problem
- Optimal cooperation and submodularity for computing Potts partition functions with a large number of states
This page was built for publication: Hypergraphic submodular function minimization