Hypergraphic submodular function minimization

DOI10.1016/J.DISC.2013.08.008MaRDI QIDQ393937zbMATH OpenOpenAlexFDO

Authors Zoltán Miklós

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

zbMATH Keywords

push-relabel methodsubmodular function minimization

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Hypergraphs (05C65) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Recommendations

• Graphic submodular function minimization: a graphic approach and applications
• Improved algorithms for submodular function minimization and submodular flow
• On submodular function minimization
• Minimizing symmetric submodular functions
• A faster strongly polynomial time algorithm for submodular function minimization

Cites work

• A new approach to the maximum-flow problem
• A push-relabel framework for submodular function minimization and applications to parametric optimization
• Optimal attack and reinforcement of a network
• Optimal cooperation and submodularity for computing Potts  partition functions with a large number of states
• Trees and Cuts

Cited in

(2)

• On some algorithmic aspects of hypergraphic matroids
• Graphic submodular function minimization: a graphic approach and applications

This page was built for publication: Hypergraphic submodular function minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393937)