Different Approximation Algorithms for Channel Scheduling in Wireless Networks

Algorithm 3

Optimized algorithm in single-channel .

Require: constant and graph .
Ensure:
(1)	Let ;
(2)	Run greedy-single-channel (.) to find an -approximation ;
(3)	Let ;
(4)	If ;
(5)	Then, run PTAS (.) to find an -IS-approximation ;
(6)	Return with ;