Experimental evaluation of a modified carousel algorithm For the minimum weight vertex cover problem
Loading...
Date
2017
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Faculté des Mathématiques et de l’Informatique - Université Mohamed BOUDIAF - M’sila
Abstract
In 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.
Description
Keywords
NP-complete problem, greedy algorithm ,minimum weight vertex cover problem, heuristic.