Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks
Xiang‐Yang Li, Yu Wang · 2002
In wireless ad hoc networks, each wireless device has a transmission range, which is usually modeled as a disk centered at this node. A wireless node can send message directly to all nodes lying inside this disk. We present several intersection graphs to model the wireless networks. Then we present some simple heuristics and/or PTASs to approximate the maximum independent set, the minimum vertex cover and the minimum graph coloring in these graph models.