Approximation Algorithms for the Weighted Independent Set Problem

In unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters, such as the number of vertices, maximum degree, and average degree. In weighted case, no corresponding results are given for average degree. It is not appropriate that we analyze weighted independent set algorithms in terms of average degree, since inserting the vertices with small weight decreases average degree arbitrarily without significantly changing approximation ratio. In this paper, we introduce the “weighted” average degree and “weighted” inductiveness, and analyze algorithms for the weighted independent set problem in terms of these parameters.

• Type: Conference
• Year: 2005
• Where: WG
• Authors: Akihisa Kako, Takao Ono, Tomio Hirata, Magnús M. Halldórsson
• Keywords: Average Degree, Computer Science, Independent Set Problem, Weighted Independent Set, WG 2005