Abstract
In this paper, we study the Dominating Set problem with measure functions, which is extended from the general Dominating Set problem. We study the correspondnig problems on complexity, approximation and inapproximability for Dominating Set problem with measure functions. In addition, we extend our results to the weighted graphs.
Keywords
Cite this article
@article{cai-1323,
author = {Ning Chen and Jie Meng and Jiawei Rong and Hong Zhu},
title = {Approximation for Dominating Set Problem with Measure Functions},
journal = {Computing and Informatics},
volume = {23},
number = {1},
pages = {37--49},
year = {2004},
issn = {1335-9150},
url = {https://cai.type.sk/content/2004/1/approximation-for-dominating-set-problem-with-measure-functions/}
}
TY - JOUR AU - Ning Chen AU - Jie Meng AU - Jiawei Rong AU - Hong Zhu TI - Approximation for Dominating Set Problem with Measure Functions JO - Computing and Informatics VL - 23 IS - 1 SP - 37 EP - 49 PY - 2004 SN - 1335-9150 UR - https://cai.type.sk/content/2004/1/approximation-for-dominating-set-problem-with-measure-functions/ KW - Dominating set KW - complexity KW - approximation KW - inapproximability ER -
Chen, N., Meng, J., Rong, J., & Zhu, H. (2004). Approximation for Dominating Set Problem with Measure Functions. Computing and Informatics, 23(1), 37–49. https://cai.type.sk/content/2004/1/approximation-for-dominating-set-problem-with-measure-functions/