✦ LIBER ✦

Approximating vertex cover in dense hypergraphs

✍ Scribed by Jean Cardinal; Marek Karpinski; Richard Schmied; Claus Viehmann

Book ID: 113699094
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 227 KB
Volume: 13
Category: Article
ISSN: 1570-8667
DOI: 10.1016/j.jda.2012.01.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On approximation of the vertex cover pro

On approximation of the vertex cover problem in hypergraphs

✍ Michael Okun 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 279 KB

Approximating minimum feedback vertex se

Approximating minimum feedback vertex sets in hypergraphs

✍ Toshihiro Fujito 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 102 KB

Improved Approximation Algorithms for th

Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs

✍ Halperin, Eran 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 198 KB

Connected vertex covers in dense graphs

✍ Jean Cardinal; Eythan Levy 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 388 KB

Approximate Set Covering in Uniform Hype

Approximate Set Covering in Uniform Hypergraphs

✍ Michael Krivelevich 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 296 KB

The weighted set covering problem, restricted to the class of r-uniform hypergraphs, is considered. We propose a new approach, based on a recent result of Aharoni, Holzman, and Krivelevich about the ratio of integer and fractional covering numbers in k-colorable r-uniform hypergraphs. This approach,

Bounding the vertex cover number of a hy

Bounding the vertex cover number of a hypergraph

✍ Guo-Li Ding; Paul Seymour; Peter Winkler 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 539 KB