Approximation algorithms for minimum power k backbone node r-connected subgraph problem in wireless sensor networks

DOI10.1142/S1793830920500123zbMath1434.68682OpenAlexW2989134466MaRDI QIDQ5216451

M. Prasanna Lakshmi, D. Pushparaj Shetty

Publication date: 18 February 2020

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830920500123

zbMATH Keywords

graph algorithmsapproximation algorithmswireless sensor networkstopology control problemrange assignment

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Wireless sensor networks as related to computer science (68M18)

Cites Work

• Unnamed Item
• Unnamed Item
• Survivable network activation problems
• Approximating minimum-power degree and connectivity problems
• On minimum power connectivity problems
• Power assignment for \(k\)-connectivity in wireless ad hoc networks
• On the hardness of range assignment problems

This page was built for publication: Approximation algorithms for minimum power k backbone node r-connected subgraph problem in wireless sensor networks