✦ LIBER ✦

A note on ‘Algorithms for connected set cover problem and fault-tolerant connected set cover problem’

✍ Scribed by Wei Ren; Qing Zhao

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity and approximation of the conn

✍ Wei Zhang, Weili Wu, Wonjun Lee, Ding-Zhu Du 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 246 KB

Approximation algorithms for a geometric

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

Approximation Algorithms for the Set Cov

✍ Hochbaum, Dorit S. 📂 Article 📅 1982 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 259 KB

A genetic algorithm for the set covering

✍ J.E Beasley; P.C Chu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 939 KB

A note on the generalized min-sum set co

✍ Martin Skutella; David P. Williamson 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 208 KB

A note on some computationally difficult

✍ Davis Avis 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 375 KB