Cones of alternating and cut submodular set functions

DOI10.1007/BF02122680MaRDI QIDQ1121293zbMATH OpenFDO

Authors Viacheslav Grishukhin

Publication date 1989

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02122680

zbMATH Keywords

cut submodular set functionshypergraph cut set functionnetwork flow algorithmset functions

Mathematics Subject Classification ID

Graph theory (05C99) Polytopes and polyhedra (52Bxx) Graph theory (including graph drawing) in computer science (68R10) Integer programming (90C10)

Recommendations

• Publication:3475144
• Minimum cuts, modular functions, and matroid polyhedra
• Minimizing symmetric submodular functions
• On submodular function minimization
• Realization of set functions as cut functions of graphs and hypergraphs

Cites work

• Minimum cuts, modular functions, and matroid polyhedra
• n-alternation deficiency of geometric rank-functions
• Theory of capacities

Cited in

(5)

• Realization of set functions as cut functions of graphs and hypergraphs
• New bounds for subset selection from conic relaxations
• Realizing symmetric set functions as hypergraph cut capacity
• scientific article; zbMATH DE number 4143803 (Why is no real title available?)
• Minimum cuts, modular functions, and matroid polyhedra

This page was built for publication: Cones of alternating and cut submodular set functions

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