A simple approximation algorithm for WIS based on the approximability in $k$-partite graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2005

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

Résumé

In this note, simple approximation algorithms for the weighted independent set problem are presented with a performance ratio depending on $\Delta(G)$. These algorithms do not improve the best approximation algorithm known so far for this problem but they are of interest because of their simplicity. Precisely, we show how an optimum weighted independent set in bipartite graphs and a $\rho$-approximation of {\wis} in $k$-partite graphs respectively allows to obtain a ${2\over \Delta(G)}$-approximation and a ${k\over \Delta(G)}\rho$-approximation in general graphs. Note that the ratio ${2\over \Delta(G)}$ is the best bound known for the particular cases $\Delta(G)=3$ or $\Delta(G)=4$.
Fichier principal
Vignette du fichier
wis_prelim_.pdf (84.32 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-00007801 , version 1 (05-08-2005)

Identifiants

  • HAL Id : hal-00007801 , version 1

Citer

Jérôme Monnot. A simple approximation algorithm for WIS based on the approximability in $k$-partite graphs. European Journal of Operational Research, 2005, to appear, pp.1-4. ⟨hal-00007801⟩
134 Consultations
100 Téléchargements

Partager

Gmail Facebook X LinkedIn More