Consider a set S of n homogeneous sensors and a set A of m targets. A subset S′ of S is called a sensor k-cover if every target in A is covered by at least k sensors in S′. In this chapter, we study the following problem.
|Title of host publication||Springer Optimization and Its Applications|
|Number of pages||17|
|Publication status||Published - 2020|
|Name||Springer Optimization and Its Applications|
ASJC Scopus subject areas
- Control and Optimization