Karpinski, Marek; Schmied, Richard; Viehmann, Claus Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs. (English) Zbl 1337.68292 J. Discrete Algorithms 33, 49-57 (2015). MSC: 68W25 05C65 05C70 PDFBibTeX XMLCite \textit{M. Karpinski} et al., J. Discrete Algorithms 33, 49--57 (2015; Zbl 1337.68292) Full Text: DOI arXiv
Cardinal, Jean; Karpinski, Marek; Schmied, Richard; Viehmann, Claus Approximating vertex cover in dense hypergraphs. (English) Zbl 1252.68135 J. Discrete Algorithms 13, 67-77 (2012). MSC: 68Q17 05C85 05C70 05C65 68W25 PDFBibTeX XMLCite \textit{J. Cardinal} et al., J. Discrete Algorithms 13, 67--77 (2012; Zbl 1252.68135) Full Text: DOI arXiv