A New and Fast Approximation Algorithm for Vertex Cover Using a Maximum Independent Set (VCUMI)
The importance of non-deterministic polynomial (NP) problems in real world scenarios has compelled researchers to consider simple ways of finding approximate solutions to these problems in polynomial time. Minimum vertex cover is an NP complete problem, where the objective is to cover all the edges...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wrocław University of Science and Technology
2015-01-01
|
| Series: | Operations Research and Decisions |
| Online Access: | http://orduser.pwr.wroc.pl/DownloadFile.aspx?aid=1156 |