Lei Chen, Changhong Lu, Zhenbing Zeng. Hardness results and approximation algorithms for (weighted) paired-domination in graphs. Theoretical Computer Science, 410(47-49):5063-5071, 2009. [doi]
@article{ChenLZ09-3,
title = {Hardness results and approximation algorithms for (weighted) paired-domination in graphs},
author = {Lei Chen and Changhong Lu and Zhenbing Zeng},
year = {2009},
doi = {10.1016/j.tcs.2009.08.004},
url = {http://dx.doi.org/10.1016/j.tcs.2009.08.004},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/ChenLZ09-3},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {410},
number = {47-49},
pages = {5063-5071},
}