Solving Minimum Vertex Cover Problem Using Learning Automata

11/28/2013
by   Aylin Mousavian, et al.
0

Minimum vertex cover problem is an NP-Hard problem with the aim of finding minimum number of vertices to cover graph. In this paper, a learning automaton based algorithm is proposed to find minimum vertex cover in graph. In the proposed algorithm, each vertex of graph is equipped with a learning automaton that has two actions in the candidate or non-candidate of the corresponding vertex cover set. Due to characteristics of learning automata, this algorithm significantly reduces the number of covering vertices of graph. The proposed algorithm based on learning automata iteratively minimize the candidate vertex cover through the update its action probability. As the proposed algorithm proceeds, a candidate solution nears to optimal solution of the minimum vertex cover problem. In order to evaluate the proposed algorithm, several experiments conducted on DIMACS dataset which compared to conventional methods. Experimental results show the major superiority of the proposed algorithm over the other methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/18/2022

A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number

The NP-hard graphical traveling salesman problem (GTSP) is to find a clo...
research
08/13/2013

Extended Distributed Learning Automata:A New Method for Solving Stochastic Graph Optimization Problems

In this paper, a new structure of cooperative learning automata so-calle...
research
04/24/2019

Reoptimization of Path Vertex Cover Problem

Most optimization problems are notoriously hard. Considerable efforts mu...
research
03/29/2019

Solving large Minimum Vertex Cover problems on a quantum annealer

We consider the minimum vertex cover problem having applications in e.g....
research
12/12/2018

On Graphs with Minimal Eternal Vertex Cover Number

The eternal vertex cover problem is a variant of the classical vertex co...
research
03/14/2019

An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs

This paper proposes a novel branch-and-bound(BMWVC) algorithm to exactly...
research
11/11/2022

A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets

We propose a new approach to the Directed Feedback Vertex Set Problem (D...

Please sign up or login with your details

Forgot password? Click here to reset