๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On approximation of the vertex cover problem in hypergraphs

โœ Scribed by Michael Okun

Book ID
108114333
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
279 KB
Volume
2
Category
Article
ISSN
1572-5286

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Approximating vertex cover in dense hype
Approximating vertex cover in dense hypergraphs
โœ Jean Cardinal; Marek Karpinski; Richard Schmied; Claus Viehmann ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 227 KB
A better approximation ratio for the ver
A better approximation ratio for the vertex cover problem
โœ Karakostas, George ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Association for Computing Machinery ๐ŸŒ English โš– 88 KB

We reduce the approximation factor for the vertex cover to 2 โˆ’ ฮ˜ (1/โˆšlog __n__ ) (instead of the previous 2 โˆ’ ฮ˜ ln ln __n__ /2ln __n__ obtained by Bar-Yehuda and Even [1985] and Monien and Speckenmeyer [1985]). The improvement of the vanishing factor comes as an application of the recent results of