This paper considers the NP-hard problem of scheduling weighted links in concurrent transmit/receive wireless mesh networks. The problem generalizes existing works to links with weight wij ≥ 1. We propose an O(|V|2) algorithm, where V is the set of routers, that is orders of magnitude faster than computationally intensive approaches that use the well-known Goemans-Williamson (GWA)'s maximum cut algorithm and also brute-force. Our algorithm generates schedules, on average, with at most 3% and 9% fewer links than the GWA and brute-force approaches respectively.
K. Chin, S. Soh & C. Meng, "A novel scheduler for concurrent Tx/Rx wireless mesh networks with weighted links," IEEE Communications Letters, vol. 16, (2) pp. 246-248, 2012.