\name{vCoverHypergraph} \alias{vCoverHypergraph} \title{Approximate minimum weight vertex cover in a hypergraph} \description{Approximate minimum weight vertex cover in a hypergraph } \usage{ vCoverHypergraph(hg, vW=rep(1, numNodes(hg))) } \arguments{ \item{hg}{an instance of the \code{Hypergraph} class } \item{vW}{vertex weights} } \details{ Hypergraph \code{g} has non-negative weights on its vertices. The minimum weight vertex cover problem is to find a subset of vertices C such that C includes at least one vertex from each hyperedge and the sum of the weights of the vertices in C is minimum. This problem is NP-hard. We implement the greedy algorithm to approximate near-optimal solution, proposed by E. Ramadan, A. Tarafdar, A. Pothen, 2004. } \value{ A list of vertices from hypergraph \code{g}. } \references{ A hypergraph model for the yeast protein complex network, Ramadan, E. Tarafdar, A. Pothen, A., Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International. } \author{Li Long