✦ LIBER ✦

Algorithms for the minimum weightk-fold (connected) dominating set problem

✍ Scribed by Wenkai Ma; Deying Li; Zhao Zhang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for minimum -connected -tuple

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

Two algorithms for minimum 2-connected r

✍ Xiuying Li; Zhao Zhang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 158 KB

On-line algorithms for the dominating se

✍ Gow-Hsing King; Wen-Guey Tzeng 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 346 KB

Ant colony optimization algorithm with p

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

Fast algorithms for the dominating set p

✍ Kuo-Hui Tsai; Wen-Lian Hsu 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 616 KB

A distributed approximation algorithm fo

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