Broadcasting with the Least Energy is an NP-Complete Problem

Wuu Yang, Huei-Ru Tseng, Rong-Hong Jan, Bor-Yeh Shen. Broadcasting with the Least Energy is an NP-Complete Problem. In 2008 International Conference on Multimedia and Ubiquitous Engineering (MUE 2008), 24-26 April 2008, Busan, Korea. pages 197-200, IEEE Computer Society, 2008. [doi]

@inproceedings{YangTJS08,
  title = {Broadcasting with the Least Energy is an NP-Complete Problem},
  author = {Wuu Yang and Huei-Ru Tseng and Rong-Hong Jan and Bor-Yeh Shen},
  year = {2008},
  doi = {10.1109/MUE.2008.48},
  url = {http://doi.ieeecomputersociety.org/10.1109/MUE.2008.48},
  tags = {completeness},
  researchr = {https://researchr.org/publication/YangTJS08},
  cites = {0},
  citedby = {0},
  pages = {197-200},
  booktitle = {2008 International Conference on Multimedia and Ubiquitous Engineering (MUE 2008), 24-26 April 2008, Busan, Korea},
  publisher = {IEEE Computer Society},
}