Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
Faisal N. Abu-Khzam, Michael R. Fellows, Michael A...
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
We consider the mixed integer version of bipartite vertex cover. This is equivalent to the mixed integer network dual model, recently introduced in [2], that generalizes several m...
Michele Conforti, Laurence A. Wolsey, Giacomo Zamb...
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G ...