Article thumbnail

Covering Symmetric Supermodular Functions By Uniform Hypergraphs

By Tamás Király and Technical Reports

Abstract

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

Year: 2002
OAI identifier: oai:CiteSeerX.psu:10.1.1.18.5158
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.elte.hu/egres/de... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.