Realization of set functions as cut functions of graphs and hypergraphs

DOI10.1016/S0012-365X(00)00164-3zbMath0969.90015OpenAlexW2000478304MaRDI QIDQ1841904

Sachin B. Patkar, Satoru Fujishige

Publication date: 18 February 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00164-3

zbMATH Keywords

networksgraphshypergraphshypernetworks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Hypergraphs (05C65) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Realizing symmetric set functions as hypergraph cut capacity ⋮ Structured Sparsity: Discrete and Convex Approaches ⋮ Hypergraph Cuts with General Splitting Functions ⋮ Efficiently Realizing Interval Sequences ⋮ Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms ⋮ Soft arc consistency revisited ⋮ Minimization of locally defined submodular functions by optimal soft arc consistency

This page was built for publication: Realization of set functions as cut functions of graphs and hypergraphs