An optimal approximation algorithm for optimization of un-weighted minimum vertex cover problem
Mean of Neighbors of Minimum Degree Algorithm (MNMA) is proposed in this paper. The MNMA produces optimal or near optimal vertex cover for any known undirected, un-weighted graph. The MNMA adds a vertex cover at each step among those vertices which are neighbors of minimum degree vertices having deg...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Sindh, Jamshoro, Pakistan
2016
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/53856/ http://irep.iium.edu.my/53856/ http://irep.iium.edu.my/53856/1/An%20Optimal%20Approximation%20Algorithm%20for%20Optimization%20of%20Un-Weighted%20Minimum%20Vertex%20Cover%20Problem.pdf |