Approximation algorithms for minimum power k backbone node r-connected subgraph problem in wireless sensor networks.
D. Pushparaj ShettyM. Lakshmi PrasannaPublished in: Discret. Math. Algorithms Appl. (2020)
Keyphrases
- approximation algorithms
- wireless sensor networks
- np hard
- minimum cost
- constant factor
- topology control
- node selection
- undirected graph
- power consumption
- special case
- energy efficiency
- disjoint paths
- vertex cover
- facility location problem
- worst case
- energy efficient
- sensor networks
- primal dual
- malicious nodes
- network design problem
- approximation schemes
- energy consumption
- spanning tree
- approximation ratio
- resource constrained
- set cover
- np hardness
- connected components
- computational complexity
- randomized algorithms
- active learning
- open shop
- precedence constraints
- sensor nodes
- multi hop
- network flow
- edge weights
- sample complexity
- integer programming
- routing protocol
- linear program
- mobile nodes
- lower bound
- directed graph
- branch and bound algorithm
- search space
- polynomial time approximation
- linear programming
- dynamic programming
- upper bound
- optimal solution