On a Polynomially Solvable Subclass of the Clique Problem with Applications in Energy-Efficient Timetabling.
Patrick GemanderPublished in: OR (2018)
Keyphrases
- energy efficient
- polynomially solvable
- np complete
- wireless sensor networks
- np hard
- processing times
- special case
- energy consumption
- sensor networks
- computational complexity
- base station
- data gathering
- multi hop
- data transmission
- energy efficiency
- data dissemination
- routing protocol
- feasible solution
- data collection
- lower bound
- multi core architecture
- sensor nodes
- scheduling problem
- optimal solution
- power consumption
- high speed
- objective function