A 5+epsilon-approximation algorithm for minimum weighted dominating set in unit disk graph

@article{Dai2009A5A,
  title={A 5+epsilon-approximation algorithm for minimum weighted dominating set in unit disk graph},
  author={Decheng Dai and Changyuan Yu},
  journal={Theor. Comput. Sci.},
  year={2009},
  volume={410},
  pages={756-765}
}
We study the minimum weight dominating set problem in weighted unit disk graph, and give a polynomial time algorithm with approximation ratio 5+ , improving the previous best result of 6 + in [Yaochun Huang, Xiaofeng Gao, Zhao Zhang, Weili Wu, A better constant-factor approximation for weighted dominating set in unit disk graph, J. Comb. Optim. (ISSN: 1382-6905) (2008) 1573–2886. (Print) (Online)]. Combining the common technique used in the above mentioned reference, we can compute a minimum… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 31 extracted citations

Similar Papers

Loading similar papers…