On the Complexity of Sub-Tree Scheduling for Wireless Sensor Networks with Partial Coverage

Michele Barbato, Nicola Bianchessi

Given an undirected graph $G$ whose edge weights change over $s$ time slots, the sub-tree scheduling for wireless sensor networks with partial coverage asks to partition the vertic…