Bounded-degree minimum-radius spanning trees in wireless sensor networks.
Min Kyung AnNhat X. LamDung T. HuynhTrac N. NguyenPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- spanning tree
- wireless sensor networks
- edge disjoint
- minimum cost
- bounded degree
- minimum spanning tree
- energy efficient
- energy consumption
- sensor networks
- total length
- minimum total cost
- minimum spanning trees
- approximation algorithms
- weighted graph
- np hard
- logic programming
- routing protocol
- databases
- graph theoretic