Algorithm research for prize-collecting dominating set problem on special graph

Abstract

The prize-collecting dominating set (PCDS) problem is the generalization of the minimum dominating set (MDS) problem. The MDS problem requires a dominating set in a given graph, namely a subset of vertexes. Any vertex in the graph belongs to the closed neighborhood of the subset of vertexes, where the subset of vertexes with the smallest cardinality is the MDS. In the PCDS problem: given an undirected graph, its vertex set V has nonnegative weighting function  and nonnegative penalty function  . Finding a vertex subset D V  , for vertexes do not belong to the closed neighborhood of D , we need to pay penalties for them. The objective of this issue is to minimize the sum of weights and penalties. As we all know that the MDS problem is NP-hard in general graph, obviously, PCDS problem is NP-hard, too., In certain cases, the PCDS problem can achieve better results than the MDS problem, which has a certain value in practical applications such as facility location and logistics management. Whether the problem is limited to a special graph will get useful structural characterization and corresponding algorithm results is considered, designed polynomial time exact algorithm on the star and according to the r -LMP approximation algorithm, designed the 2-LMP approximation algorithm on the path and cycle.