Book ChapterDOI
An Articulation Point-Based Approximation Algorithm for Minimum Vertex Cover Problem
Jayanth Kumar Thenepalle,Purusotham Singamsetty +1 more
- pp 281-289
Reads0
Chats0
TLDR
The aim of this paper is to present an approximation algorithm for minimum vertex cover problem (MVCP) based on articulation points/cut vertices and leaf vertices/pendant vertices that assures the near optimal or optimal solution for a given graph and can be solved in polynomial time.Abstract:
The minimum vertex cover problem (MVCP) is a well-known NP complete combinatorial optimization problem. The aim of this paper is to present an approximation algorithm for minimum vertex cover problem (MVCP). The algorithm construction is based on articulation points/cut vertices and leaf vertices/pendant vertices. The proposed algorithm assures the near optimal or optimal solution for a given graph and can be solved in polynomial time. A numerical example is illustrated to describe the proposed algorithm. Comparative results show that the proposed algorithm is very competitive compared with other existing algorithms.read more
References
More filters
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Journal ArticleDOI
Approximation Algorithms for the Set Covering and Vertex Cover Problems
TL;DR: A heuristic is proposed that delivers in O(n^3 ) steps a solution for the set covering problem the value of which does not exceed the maximum number of sets covering an element times the optimal value.
Journal ArticleDOI
Identifying the Minimal Transversals of a Hypergraph and Related Problems
Thomas Eiter,Georg Gottlob +1 more
TL;DR: Two decision problems on hypergraphs, hypergraph saturation and recognition of the transversal hypergraph, are considered and their significance for several search problems in applied computer science is discussed.
Journal ArticleDOI
Improved upper bounds for vertex cover
Jianer Chen,Iyad A. Kanj,Ge Xia +2 more
TL;DR: Several new techniques, as well as generalizations of previous techniques, are introduced including: general folding, struction, tuples, and local amortized analysis in the polynomial-space algorithm for Vertex Cover.
Related Papers (5)
An Approximation Algorithm for the Minimum Vertex Cover Problem
Clever Steady Strategy Algorithm: A Simple and Efficient Approximation Algorithm for Minimum Vertex Cover Problem
Muhammad Fayaz,Shakeel Arshad +1 more