๐”– Bobbio Scriptorium
โœฆ   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

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Connected vertex covers in dense graphs
โœ Jean Cardinal; Eythan Levy ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 388 KB
Approximate Set Covering in Uniform Hype
โœ 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,