The paper presents results related to a theorem of Szigeti on covering symmetric skew-supermodular set functions by hypergraphs.

This work shows that there exists a local connectivity preserving complete splitting-off in hypergraphs and gives a strongly polynomial-time algorithm to ...

The paper presents results related to a theorem of Szigeti on covering symmetric skew-supermodular set functions by hypergraphs.

The paper presents results related to a theorem of Szigeti on covering symmetric skew-supermodular set functions by hypergraphs.

The solutions to these problems and to their generalizations will be obtained from a new min-max theorem on covering a supermodular function by a simple degree- ...

In the minimum version we simply want to find a hypergraph covering p that has minimum total size. Possibly the latter problem seems more interesting and ...

In the minimum version we simply want to find a hypergraph covering p that has minimum total size. Possibly the latter problem seems more interesting and ...

The paper presents results related to a theorem of Szigeti on covering symmetric skew-supermodular set functions by hypergraphs.

Dec 16, 2014 · In this paper we give results related to a theorem of Szigeti that concerns the covering of symmetric skew-supermodular set functions with ...

In this paper we give results related to a theorem of Szigeti that concerns the covering of symmetric skew-supermodular set functions with hyperedges of minimum ...