An Optimal Algorithm for The Minimum Disc Cover Problem
本文檔由 technic123 分享于2011-11-17 13:29
The minimum disc cover can be used to construct a dominating set onthe fly for energy-efficient communications in mobile ad hoc networks, butthe approach used to compute the minimum disc cover proposed in previousstudies is computationally relatively expensive. In this paper, we show thatthe disc cover problem is in fact a special case of the general -hull problem.In spite of..
- 文檔格式：
- 文檔大小：
- 147.14K
- 文檔頁(yè)數(shù)：
- 24頁(yè)
- 頂 /踩數(shù)：
- 0 / 0
- 收藏人數(shù)：
- 0
- 評(píng)論次數(shù)：
- 0
- 文檔熱度：
- 文檔分類：
- IT計(jì)算機(jī) — 數(shù)據(jù)結(jié)構(gòu)與算法
- 添加到豆單