Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Approximation for Dominating Set Problem with Measure Functions

In: Computing and Informatics, vol. 23, no. 1
Ning Chen - Jie Meng - Jiawei Rong - Hong Zhu

Details:

Year, pages: 2004, 37 - 49
Keywords:
Dominating set, complexity, approximation, inapproximability
About article:
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.
How to cite:
ISO 690:
Chen, N., Meng, J., Rong, J., Zhu, H. 2004. Approximation for Dominating Set Problem with Measure Functions. In Computing and Informatics, vol. 23, no.1, pp. 37-49. 1335-9150.

APA:
Chen, N., Meng, J., Rong, J., Zhu, H. (2004). Approximation for Dominating Set Problem with Measure Functions. Computing and Informatics, 23(1), 37-49. 1335-9150.