Realizing symmetric set functions as hypergraph cut capacity
From MaRDI portal
Recommendations
Cites work
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- A faster strongly polynomial time algorithm for submodular function minimization
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- Cones of alternating and cut submodular set functions
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 3645097 (Why is no real title available?)
- Minimizing symmetric submodular functions
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- Realization of set functions as cut functions of graphs and hypergraphs
- Submodular functions and electrical networks
- The ellipsoid method and its consequences in combinatorial optimization
Cited in
(3)
This page was built for publication: Realizing symmetric set functions as hypergraph cut capacity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284712)