Approximation for Dominating Set Problem with Measure Functions
Ning Chen ; Jie Meng ; Jiawei Rong ; Hong Zhu
Computing and Informatics, Tome 28 (2012) no. 1, / Harvested from Computing and Informatics
Text on Computing and Informatics
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.
Publié le : 2012-01-26
Classification:  Dominating set; complexity; approximation; inapproximability 
@article{cai407,
     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 = {28},
     number = {1},
     year = {2012},
     language = {en},
     url = {http://dml.mathdoc.fr/item/cai407}
}

Ning Chen; Jie Meng; Jiawei Rong; Hong Zhu. Approximation for Dominating Set Problem with Measure Functions. Computing and Informatics, Tome 28 (2012) no. 1, . http://gdmltest.u-ga.fr/item/cai407/