Banharnsakun, Anan - In: Decision analytics journal 6 (2023), pp. 1-6
The minimum vertex cover problem is a well-known problem in classical graph theory. It is known as one of the NP-Hard optimization problems, meaning that the best solution cannot be found within an acceptable time. Therefore, to handle this optimization problem effectively, various alternative...