Wang, Zhong; Wang, Wei; Kim, Joon-Mo; Thuraisingham, Bhavani - In: Journal of Global Optimization 54 (2012) 3, pp. 641-648
The minimum weighted dominating set (MWDS) problem is one of the classic NP-hard optimization problems in graph theory with applications in many fields such as wireless communication networks. MWDS in general graphs has been showed not to have polynomial-time constant-approximation if <InlineEquation ID="IEq1"> <EquationSource...</equationsource></inlineequation>