Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs

Optimization Letters(2016)

引用 3|浏览6
暂无评分
摘要
The strongly connected dominating and absorbing set (DAS) is used as a virtual backbone in heterogeneous wireless sensor. To reduce routing cost, we introduce a routing-cost constraint and study the problem of computing the minimum strongly connected DAS under routing-cost constraint. An approximation algorithm with guaranteed performance will be presented.
更多
查看译文
关键词
Dominating and absorbing set,Strongly connected,Virtual backbone,Heterogeneous sensor networks,Approximation algorithm,Guaranteed performance
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要