✦ LIBER ✦

A greedy algorithm for the minimum\(2\)-connected\(m\)-fold dominating set problem

✍ Scribed by Shi, Yishuo; Zhang, Yaping; Zhang, Zhao; Wu, Weili

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for the minimum weightk-fold

✍ Wenkai Ma; Deying Li; Zhao Zhang 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 492 KB

Formulations for the Minimum 2-Connected

✍ do Forte, Vinicius Leal; Lucena, Abilio; Maculan, Nelson 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 162 KB

Algorithms for minimum -connected -tuple

✍ Weiping Shang; Pengjun Wan; Frances Yao; Xiaodong Hu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 218 KB

A greedy algorithm for the fault-toleran

✍ Jiao Zhou, Zhao Zhang, Weili Wu, Kai Xing 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 237 KB

A distributed approximation algorithm fo

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

Ant colony optimization algorithm with p

✍ Jovanovic, Raka; Tuba, Milan 📂 Article 📅 2013 🏛 KoBSON 🌐 English ⚖ 132 KB