A simple approximation algorithm for WIS based on the approximability in k-partite graphs

Jérôme Monnot (1)

1 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision

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.

Mots clés: k- partite graphs; Approximation algorithms; Coloring; Weighted Independent Set; k- partite graphs.

Domaines: Complexité [cs.CC]; Mathématique discrète [cs.DM]

Jérôme Monnot. A simple approximation algorithm for WIS based on the approximability in k-partite graphs. 2003. ⟨hal-00004072⟩