Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2016, Article ID 9790629, 10 pages
Research Article

A New Distributed Approximation Algorithm for the Maximum Weight Independent Set Problem

1College of Automation, Nanjing University of Posts and Telecommunications, Nanjing 210023, China
2National Mobile Communications Research Laboratory, Southeast University, Nanjing, China

Received 9 March 2016; Revised 29 July 2016; Accepted 9 August 2016

Academic Editor: Dan Simon

Copyright © 2016 Peng Du and Yuan Zhang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Maximum weight independent set (MWIS) is a combinatorial optimization problem that naturally arises in many applications especially wireless networking. This paper studies distributed approximation algorithms for finding MWIS in a general graph. In the proposed algorithm, each node keeps exchanging messages with neighbors in which each message contains partial solutions of the MWIS optimization program. A parameter is introduced to achieve different tradeoff between approximation accuracy and space complexity. Theoretical analysis shows that the proposed algorithm is guaranteed to converge to an approximate solution after finite iterations; specifically, the proposed algorithm is guaranteed to converge to the optimal solution with . Simulation results confirm the effectiveness of the proposed distributed algorithm in terms of weight sum, message size, and convergence performance.