TAIBI Salah Eddine, Salah Eddine2018-02-042018-02-042017https://repository.univ-msila.dz/handle/123456789/2204In this study we deal with minimum weight vertex cover problem as one of the fundamental problems in graph theory with many real-life applications such as ,in wireless communication ,circuit design and network flows .It is well-known NP-complete problem and hence no polynomial-time algorithm has been found yet for solving it to optimality. We have implemented a modified carousel algorithm for tackling this problem in order to obtain good feasible solutions in reasonable computational time . The letter is enhanced by introducing greedy heuristics to improve the quality of solution. The performance of our approach has been tested on well-known dataset.enNP-complete problem, greedy algorithm ,minimum weight vertex cover problem, heuristic.Thesis