✦ LIBER ✦

A greedy algorithm for the fault-tolerant connected dominating set in a general graph

✍ Scribed by Jiao Zhou, Zhao Zhang, Weili Wu, Kai Xing

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A greedy algorithm for the minimum\(2\)-

✍ Shi, Yishuo; Zhang, Yaping; Zhang, Zhao; Wu, Weili 📂 Article 📅 2014 🏛 Springer US 🌐 English ⚖ 441 KB

A generalized greedy routing algorithm f

✍ Huaming Zhang; Xin He 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 303 KB

A distributed approximation algorithm fo

✍ Anurag Verma, Sergiy Butenko 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 500 KB

A -approximation algorithm for minimum w

✍ Decheng Dai; Changyuan Yu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 919 KB

A note on ‘Algorithms for connected set

✍ Wei Ren; Qing Zhao 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 229 KB

Analysis of a greedy heuristic for findi

✍ Abhay K. Parekh 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 458 KB