Different Approximation Algorithms for Channel Scheduling in Wireless Networks
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 f,g. We present a series of simple and practical-for-implementation greedy algorithms which give constant factor approximation in bot...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2020-01-01
|
| Series: | Mobile Information Systems |
| Online Access: | http://dx.doi.org/10.1155/2020/8836517 |