A (4 + $ε$)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs. Erlebach, T. & Mihalák, M. In Proceedings of the 7th Workshop on Approximation and Online Algorithms (WAOA 2009), of LNCS, 2009. Springer.
A (4 + $ε$)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs. [link]Paper  bibtex   
@INPROCEEDINGS{ErlebachM2009Pr,
  author = {Thomas Erlebach and Mat{\'u}\v{s} Mihal{\'a}k},
  title = {{A} (4 + $\epsilon$)-{A}pproximation for the {M}inimum-{W}eight {D}ominating
	{S}et {P}roblem in {U}nit {D}isk {G}raphs.},
  booktitle = {Proceedings of the 7th Workshop on Approximation and Online Algorithms
	(WAOA 2009)},
  year = {2009},
  series = {LNCS},
  publisher = {Springer},
  url = {http://libra.msra.cn/Publication/13760210/a-4-+-epsilon-approximation-for-the-minimum-weight-dominating-set-problem-in-unit-disk-graphs}
}

Downloads: 0