✦ LIBER ✦

A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem

✍ Scribed by Hassin, Refael; Levin, Asaf

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Faster, Better Approximation Algorithm

✍ Archer, Aaron; Levin, Asaf; Williamson, David P. 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 385 KB

A population-based iterated greedy algor

✍ Salim Bouamama; Christian Blum; Abdellah Boukerram 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 276 KB

Improved approximation algorithms for mi

✍ Hiroki Morizumi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 130 KB

Approximation algorithms for a geometric

✍ Valentin E. Brimkov; Andrew Leach; Jimmy Wu; Michael Mastroianni 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 263 KB

An Approximation Algorithm for the Minim

✍ Zhi-Zhong Chen; Guohui Lin; Lusheng Wang 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 590 KB

A Greedy Heuristic for the Set-Covering

✍ Chvatal, V. 📂 Article 📅 1979 🏛 INFORMS 🌐 English ⚖ 116 KB