On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks

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 cases where there is a significant difference between worst-case complexity and practical complexity. This paper examines the practical complexity of the MWIS problem through extensive computational experimentation. In all, over 10000 topologies are examined. It is found that the MWIS problem can be solved quickly, for example, for a 2048 node topology, it can be solved in approximately one second. Moreover, it appears that the average computational complexity grows polynomially with the number of nodes and linearly with the mean degree of the conflict graph. Categories and Subject Descriptors C.2.1 [Computer-Communication Networks]: Network Architecture and Design

• Type: Conference
• Year: 2008
• Where: WICON
• Authors: Peng Wang, Stephan Bohacek
• Keywords: Computer Networks, MWIS Problem, Optimal Scheduling, Practical Complexity, WICON 2008