A simple approximation algorithm for WIS based on the approximability in k-partite graphs
Résumé
In this note, we show how optimal or approximate weighted independent sets in k-partite graphs may yield to a good approximate weighted independent set in general graphs. Precisely, optimal solutions in bipartite graphs do yield to a 2/Δ(G)-approximation and, more generally, p-approximate solutions in k-partite graphs yield to a k/Δ(G)p-approximation in general graphs.
Loading...