✦ LIBER ✦

Hardness results and approximation algorithms for (weighted) paired-domination in graphs

✍ Scribed by Lei Chen; Changhong Lu; Zhenbing Zeng

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Domination in graphs with bounded propag

✍ Ashkan Aazami 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 733 KB

Approximation algorithms and hardness re

✍ Refael Hassin; Jérôme Monnot; Danny Segev 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 498 KB

Labelling algorithms for paired-dominati

✍ Lei Chen; Changhong Lu; Zhenbing Zeng 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 368 KB

Improved Algorithms and Complexity Resul

✍ Jiong Guo; Rolf Niedermeier; Daniel Raible 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 495 KB

A -approximation algorithm for minimum w

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

Polynomial algorithms for the weighted p

✍ Maw-Shang Chang; Yi-Chang Liu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 475 KB