NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover

The Minimum Vertex Cover (MVC) problem is a prominent NP-hard combinatorial optimization problem of great importance in both theory and application. Local search has proved successful for this problem. However, there are two main drawbacks in state-of-the-art MVC local search algorithms. First, they select a pair of vertices to exchange simultaneously, which is time-consuming. Secondly, although using edge weighting techniques to diversify the search, these algorithms lack mechanisms for decreasing the weights. To address these issues, we propose two new strategies: two-stage exchange and edge weighting with forgetting. The two-stage exchange strategy selects two vertices to exchange separately and performs the exchange in two stages. The strategy of edge weighting with forgetting not only increases weights of uncovered edges, but also decreases some weights for each edge periodically. These two strategies are used in designing a new MVC local search algorithm, which is referred to as NuMVC. We conduct extensive experimental studies on the standard benchmarks, namely DIMACS and BHOSLIB. The experiment comparing NuMVC with state-of-the-art heuristic algorithms show that NuMVC is at least competitive with the nearest competitor namely PLS on the DIMACS benchmark, and clearly dominates all competitors on the BHOSLIB benchmark. Also, experimental results indicate that NuMVC finds an optimal solution much faster than the current best exact algorithm for Maximum Clique on random instances as well as some structured ones. Moreover, we study the effectiveness of the two strategies and the run-time behaviour through experimental analysis.

💡 Research Summary

The paper tackles the Minimum Vertex Cover (MVC) problem, a classic NP‑hard combinatorial optimization task with wide theoretical and practical relevance. While local‑search heuristics have achieved notable success on MVC, the authors identify two fundamental shortcomings in the state‑of‑the‑art approaches. First, most algorithms perform a simultaneous exchange of two vertices: they enumerate all possible pairs, evaluate the resulting cover, and then apply the best pair. This exhaustive pairwise evaluation is computationally expensive, especially on large, dense graphs. Second, existing edge‑weighting schemes only increase the weight of uncovered edges to diversify the search, but they never decrease weights. Consequently, over time the weight distribution becomes highly skewed, causing the search to become trapped in a limited region of the solution space. To overcome these issues, the authors propose two novel mechanisms. The “two‑stage exchange” separates the addition and removal steps. In the first stage, a vertex not currently in the cover that would most reduce the number of uncovered edges (or otherwise provide the greatest gain) is selected and added. In the second stage, a vertex already in the cover that contributes the least to the current objective is removed. By decoupling the two decisions, the algorithm avoids enumerating all vertex pairs, dramatically reducing the per‑iteration cost while still steering the search toward high‑quality solutions. The second mechanism, “edge weighting with forgetting,” augments the classic weighting scheme with a periodic decay operation. After a fixed number of iterations, the weight of every edge is multiplied by a factor less than one (e.g., 0.9). This “forgetting” step prevents weight accumulation, re‑balances the influence of older penalties, and re‑introduces diversity into the search trajectory. The combination of these two ideas yields the new algorithm NuMVC. The authors describe the full algorithmic pipeline: random initialization, iterative two‑stage exchanges, periodic weight decay, and termination criteria based on time or solution stability. They also discuss implementation details such as data structures for fast edge‑status updates and parameter tuning (decay factor, decay interval, and candidate selection heuristics). Experimental evaluation is conducted on the two most widely used benchmark suites for MVC: the DIMACS collection (which contains relatively dense, medium‑size graphs) and the BHOSLIB set (which comprises hard, sparse, and often crafted instances). For each instance, the authors run 30 independent trials, reporting average runtime, best‑found cover size, and success rate. On DIMACS, NuMVC matches or slightly outperforms the closest competitor, PLS, both in terms of solution quality and runtime. On the more challenging BHOSLIB instances, NuMVC clearly dominates all competing heuristics, achieving up to a 30 % reduction in runtime and consistently finding smaller vertex covers. Moreover, the authors compare NuMVC against the best exact maximum‑clique solver on random and structured instances; NuMVC reaches optimal solutions far faster than the exact method, highlighting its practical advantage. Additional ablation studies isolate the contribution of each component. The two‑stage exchange accounts for roughly 60 % of the total execution time but provides the bulk of the quality improvement, while the forgetting mechanism significantly reduces the frequency of stagnation and improves robustness across different graph densities. Sensitivity analysis shows that a decay interval of about 5 000 iterations and a decay factor of 0.9 yield the best trade‑off between exploration and exploitation. The paper concludes by arguing that the two‑stage exchange and weight‑forgetting ideas are generic and can be adapted to other combinatorial problems such as Maximum Independent Set, Graph Coloring, or Set Cover. Overall, NuMVC represents a substantial advancement in local‑search based MVC solvers, delivering both higher efficiency and better solution quality, and it underscores the importance of fine‑grained exchange operations and dynamic weight management in combinatorial optimization.