We present an algorithm to find a minimum cover (partition) of a hypergraph using hyperforests. In a more general setting, given a demand vector associated with the hyperedges, we seek a minimum cover (partition) of this demand. This approach is used to express a vector in the hypergraphic matroid polytope as a convex combination of incidence vectors of hyperforests.
原文链接
分享
引用
