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...

A number of algorithms have been proposed for the Minimum Vertex Cover problem. However, they are far from satisfactory, especially on hard instances. In this paper, we introduce Edge Weighting Local Search (EWLS), a new local search algorithm for the Minimum Vertex Cover problem. EWLS is based on the idea of extending a partial vertex cover into a vertex cover. A key point of EWLS is to find a...

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 timeconsuming. Secondly, although...

Employing a three critical points theorem, we prove the existence ofmultiple solutions for a class of Neumann two-point boundary valueSturm-Liouville type equations. Using a local minimum theorem fordifferentiable functionals the existence of at least one non-trivialsolution is also ensured.

We study the location of local minima of the finite sample approximation to the constant modulus cost function. This paper concentrates on source separation. The main result is a connection between the number of samples and the probability of obtaining a local minimum of the finite approximation within a given sphere around the local minimum of the CM cost function.