Login / Signup

Best and worst-case coverage problems for arbitrary paths in wireless sensor networks.

Chunseok LeeDonghoon ShinSang Won BaeSunghee Choi
Published in: Ad Hoc Networks (2013)
Keyphrases
  • lower bound
  • worst case
  • wireless sensor networks
  • problems involving
  • np complete
  • path finding
  • case study
  • sensor networks
  • greedy algorithm
  • benchmark problems
  • solving problems