Covering skew-supermodular functions by hypergraphs of minimum total size
نویسندگان
چکیده
منابع مشابه
Covering symmetric supermodular functions by uniform hypergraphs
We consider the problem of finding a uniform hypergraph that satisfies cut demands defined by a symmetric crossing supermodular set function. We give min-max formulas for both the degree specified and the minimum cardinality problem. These results include as a special case a formula on the minimum number of r-hyperedges whose addition to an initial hypergraph will make it k-edge-connected.
متن کاملCovering Complete Hypergraphs with Cuts of Minimum Total Size
A cut [X,V −X] in a hypergraph with vertex-set V is the set of all edges that meet both X and V −X. Let sr(n) denote the minimum total size of any cover of the edges of the complete r-uniform hypergraph on n vertices Kr n by cuts. We show that there is a number nr such that for every n > nr, sr(n) is uniquely achieved by a cover with � n−1 r−1 � cuts [Xi, V −Xi] such that the Xi are pairwise di...
متن کاملCovering symmetric supermodular functions by graphs
The minimum number of edges of an undirected graph covering a symmetric , supermodular set-function is determined. As a special case, we derive an extension of a theorem of J. Bang-Jensen and B. Jackson on hypergraph connectivity augmentation. 0. INTRODUCTION T. Watanabe and A. Nakamura 1987] proved a min-max formula for the minimum number of new edges whose addition to a given undirected graph...
متن کاملCovering a graph with cuts of minimum total size
A cut in a graph G is the set of all edges between some set of vertices S and its complement S = V (G)− S. A cut-cover of G is a collection of cuts whose union is E(G) and the total size of a cut-cover is the sum of the number of edges of the cuts in the cover. The cut-cover size of a graph G, denoted by cs(G), is the minimum total size of a cut-cover of G. We give general bounds on cs(G), find...
متن کاملSupermodular covering knapsack polytope
The supermodular covering knapsack set is the discrete upper level set of a non-decreasing supermodular function. Submodular and supermodular knapsack sets arise naturally when modeling utilities, risk and probabilistic constraints on discrete variables. In a recent paper Atamtürk and Narayanan [6] study the lower level set of a non-decreasing submodular function. In this complementary paper we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2009
ISSN: 0167-6377
DOI: 10.1016/j.orl.2009.04.002