✦ LIBER ✦

Algorithms for minimum -connected -tuple dominating set problem

✍ Scribed by Weiping Shang; Pengjun Wan; Frances Yao; Xiaodong Hu

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

Two algorithms for minimum 2-connected r

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

Approximation Algorithms for Steiner Con

✍ Ya-Feng Wu; Yin-Long Xu; Guo-Liang Chen 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 299 KB

Hybrid metaheuristic algorithms for mini

✍ Potluri, Anupama; Singh, Alok 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 416 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