✦ LIBER ✦

A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs

✍ Scribed by Wawrzyniak, Wojciech

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A strengthened analysis of an algorithm

✍ Torben Hagerup 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 270 KB

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

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

A -approximation algorithm for minimum w

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

A PTAS for the minimum weighted dominati

✍ Xu Zhu; Wei Wang; Shan Shan; Zhong Wang; Weili Wu 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 318 KB

Computing a minimum outer-connected domi

✍ Mark Keil, J.; Pradhan, D. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 409 KB

A linear time algorithm for computing a

✍ Panda, B.S.; Pradhan, D. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 370 KB