Broadcasting with the Least Energy is an NP-Complete Problem.
Wuu YangHuei-Ru TsengRong-Hong JanBor-Yeh ShenPublished in: MUE (2008)
Keyphrases
- np complete
- randomly generated
- energy consumption
- np hard
- satisfiability problem
- computational complexity
- low energy
- energy minimization
- polynomial time complexity
- constraint satisfaction problems
- pspace complete
- minimum energy
- energy efficiency
- polynomially solvable
- np complete problems
- databases
- conjunctive queries
- digital video
- cnf formula
- energy efficient
- bounded treewidth
- digital tv
- lower bound
- database systems
- energy distribution
- multimedia