✦ LIBER ✦

A decomposition strategy for the vertex cover problem

✍ Scribed by Paola Bertolazzi; Antonio Sassano

Book ID: 113163386
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 735 KB
Volume: 31
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(89)90091-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Test Sets for Vertex Cover Problems

✍ M. Hayer; W. Hochstättler 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 93 KB

Approximation algorithms for the partiti

Approximation algorithms for the partition vertex cover problem

✍ Bera, Suman K.; Gupta, Shalmoli; Kumar, Amit; Roy, Sambuddha 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 410 KB

A new motion equation for the minimum ve

A new motion equation for the minimum vertex cover problem

✍ XinShun Xu; Zheng Tang; RongLong Wang; XuGang Wang 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 177 KB

A primal–dual approximation algorithm fo

A primal–dual approximation algorithm for the vertex cover problem

✍ Jianhua Tu; Wenli Zhou 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 225 KB