We introduce a new two-side approximation method for the channel scheduling problem, which controls the accuracy of approximation in two sides by a pair of parameters . We present a series of simple and practical-for-implementation greedy algorithms which give constant factor approximation in both sides. First, we propose four approximation algorithms for the weighted channel allocation problem: 1. a greedy algorithm for the multichannel with fixed interference radius scheduling problem is proposed and an one side -IS-approximation is obtained; 2. a greedy -approximation algorithm for single channel with fixed interference radius scheduling problem is presented; 3. we improve the existing algorithm for the multichannel scheduling and show an time -approximation algorithm; 4. we speed up the polynomial time approximation scheme for single-channel scheduling through merging two algorithms and show a -approximation algorithm. Next, we study two polynomial time constant factor greedy approximation algorithms for the unweighted channel allocation with variate interference radius. A greedy -approximation algorithm for the multichannel scheduling problem and an -approximation algorithm for single-channel scheduling problem are developed. At last, we do some experiments to verify the effectiveness of our proposed methods.

中文翻译：

---

无线网络中信道调度的不同近似算法

针对信道调度问题，我们引入了一种新的两侧近似方法，该方法通过一对参数控制两侧的近似精度。 。我们提出了一系列简单而实用的贪婪算法，它们在两侧都给出了恒定的因子近似值。首先，我们提出的加权信道分配问题4种近似算法：1.用于与固定干扰半径调度问题多信道贪婪算法和一个侧- IS-近似获得; 2.贪婪-提出了具有固定干扰半径调度问题的单信道近似算法；3.我们提高多通道调度现有的算法，并显示一个时间-近似算法; 4.通过合并两种算法，我们加快了单通道调度的多项式时间近似方案，并给出了-近似算法。接下来，我们研究了两种具有可变干扰半径的非加权信道分配的多项式时间常数因子贪婪近似算法。贪婪-多声道调度问题和近似算法-开发了单通道调度问题的近似算法。最后，我们进行了一些实验以验证所提出方法的有效性。