The critical-square-grid coverage problem in wireless sensor networks is NP-Complete

Wei-Chieh Ke, Bing-Hong Liu, Ming-Jer Tsai. The critical-square-grid coverage problem in wireless sensor networks is NP-Complete. Computer Networks, 55(9):2209-2220, 2011. [doi]

@article{KeLT11-0,
  title = {The critical-square-grid coverage problem in wireless sensor networks is NP-Complete},
  author = {Wei-Chieh Ke and Bing-Hong Liu and Ming-Jer Tsai},
  year = {2011},
  doi = {10.1016/j.comnet.2011.03.004},
  url = {http://dx.doi.org/10.1016/j.comnet.2011.03.004},
  tags = {completeness, wireless sensor networks, coverage},
  researchr = {https://researchr.org/publication/KeLT11-0},
  cites = {0},
  citedby = {0},
  journal = {Computer Networks},
  volume = {55},
  number = {9},
  pages = {2209-2220},
}