Cones of alternating and cut submodular set functions |
| |
Authors: | Dr V P Grishuhin |
| |
Institution: | (1) CEMI AN SSSR, Krasikova 32, 117418 Moscow, U.S.S.R. |
| |
Abstract: | We describe facets of the cones of alternating set functions and cut submodular set functions generated by directed and undirected graphs and by uniform even hypergraphs. This answers a question asked by L. Lovász at the Bonn Mathematical Programming Conference in 1982. We show that there is a network flow algorithm for minimizing a hypergraph cut set function. |
| |
Keywords: | 52 A 25 05 B 35 05 C 99 |
本文献已被 SpringerLink 等数据库收录! |
|