Harsh Bhasin and Geetanjli Ahuja (2012) Harnessing Genetic Algorithm for Vertex Cover Problem

getCITED

Home Search Add Content Reports Help

Edit Publication | Edit Contributors | Delete Publication | Edit References | Edit Citations

Add to Bookstack | Show Bookstack | Change Bookstack

Harnessing Genetic Algorithm for Vertex Cover Problem

Post a Comment

CONTRIBUTORS:

	Author:	Harsh Bhasin (Delhi technological University)
	Author:	Geetanjli Ahuja

JOURNAL:

International Journal on Computer Science and Engineering (IJCSE), 4(2), 218 - 223.

YEAR:

2012

PUB TYPE:

Journal Article

SUBJECT(S):

Genetic Algorithms, NP Hard Problem, Artificial Intelligence, Vertex Cover Problem, Non Deterministic Problems.

DISCIPLINE:

Engineering and Applied Sciences

HTTP:

http://www.enggjournals.com/ijcse/doc/IJCSE12-04-02-091.pdf

LANGUAGE:

English

PUB ID:

103-500-632 (Last edited on 2012/03/21 04:17:13 GMT-6)

SPONSOR(S):

ABSTRACT:
The problem of finding a minimum vertex cover is an NP hard optimization problem. Some approximation algorithms for the problem have been proposed but most of them are neither optimal nor complete. The work proposes the use of the theory of natural selection via Genetic Algorithms (GAs) for solving the problem. The proposed work has been tested for some constrained inputs and the results were encouraging. The paper also discusses the application of genetic algorithms to the solution and the requisite analysis. The approach presents a Genetic Algorithms based solution to a problem.

STATISTICS

Click on # to view
Citations		0
References		0
Comments		0
Quality		0/0.00
Interest		0/0.00
View(er)s		2/176

Quality
	N/A
High
	7
	6
	5
	4
	3
	2
	1
Low

Interest
	N/A
High
	7
	6
	5
	4
	3
	2
	1
Low

Prev | Next