A note on the Greedy algorithm for finding independent sets of Ck-free graphs

https://doi.org/10.1016/j.ipl.2009.01.009Get rights and content

Abstract

The independent set problem is known to be NP-hard. A fundamental theorem of Turán [P. Turán, On an extremal problem in graph theory, Mat. Fiz. Lapok 48 (1941) 436–452] states that any graph with n vertices and average degree d¯ contains an independent set of size at least n/(d¯+1), which is known as Turán bound. The greedy algorithm with minimum-degree pivoting rule is well-known method for attaining Turán bound. Based on this result, Hochbaum [D.S. Hochbaum, Approximating covering and packing problems: Set cover, vertex cover, independent set, and related problems, in: D.S. Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, 1997, pp. 94–143] showed that the greedy algorithm combined with LP attains performance ratio (d¯+1)/2. This paper shows that if the input graph is assumed to be Ck-free then the greedy algorithm obtains an independent set of size at least 2n/(d¯+1+k). It also proves that the LP-based algorithm has the performance ratio (d¯+1+k)/4.

References (17)

There are more references available in the full text version of this article.

Cited by (0)

View full text