Wang, Peng and Bohacek, Stephan (2010) On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks. In: 4th International ICST Conference on Wireless Internet.
![[thumbnail of 10021.pdf]](http://eprints.eai.eu/style/images/fileicons/application_pdf.png "10021.pdf")
PDF
10021.pdf
Download (481kB)
Abstract
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Consequently, it is widely believed that optimal scheduling cannot be solved in practical networks. However, there are many cas
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Date Deposited: | 04 Mar 2026 08:52 |
| Last Modified: | 18 Apr 2026 05:01 |
| URI: | http://eprints.eai.eu/id/eprint/1935 |
Actions (login required)
- View Item