ad hoc networks; approximation theory; data structures; greedy algorithms; telecommunication power management; trees (mathematics); Euclidean distance; ad hoc wireless networks; advanced data structures; amortized analysis; best published approximation ratio; general cost model; greedy approximations; greedy spider algorithm; input graph; integer program; minimum power broadcast; minimum spanning tree; power consumption minimization; power requirement; restricted Euclidean 2D cost model; transmission power assignment problem; wireless environment; Ad hoc networks; Adaptation models; Algorithm design and analysis; Approximation algorithms; Approximation methods; Data structures; Wireless communication; approximation algorithm; broadcast; energy minimization; experimental results; multi-hop wireless network; running time analysis;
机译:带有子模块成本的最小子模块覆盖率的贪婪近似
机译:带有子模块成本的最小子模块覆盖率的贪婪近似
机译:最小间隙调度的贪婪近似算法
机译:通过α点舍入的变体广播调度的新近似
机译:广播无线网络中的最小功率广播和首次故障时间的最大化。
机译:分支支持方法的调查表明了基于似然法的近似方案的准确性功效和稳健性
机译:具有子模块成本的最小子模块覆盖的贪婪近似