Two New Local Search Strategies for Minimum Vertex Cover

  title={Two New Local Search Strategies for Minimum Vertex Cover},
  author={Shaowei Cai and Kaile Su and Abdul Sattar},
In this paper, we propose two new strategies to design efficient local search algorithms for the minimum vertex cover (MVC) problem. There are two main drawbacks in state-ofthe-art MVC local search algorithms: First, they select a pair of vertices to be exchanged simultaneously, which is time consuming; Second, although they use edge weighting techniques, they do not have a strategy to decrease the weights. To address these drawbacks, we propose two new strategies: two stage exchange and edge… CONTINUE READING
8 Citations
33 References
Similar Papers

Similar Papers

Loading similar papers…