@typo3tester

On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms

, , and . Foundations of Genetic Algorithms (FOGA), page 37-44. ACM Press, (2017)

Abstract

We consider the weighted minimum vertex cover problem and investigate how its dual formulation can be exploited to design evolutionary algorithms that provably obtain a 2-approximation. Investigating multi-valued representations, we show that variants of randomized local search and the (1+1) EA achieve this goal in expected pseudo-polynomial time. In order to speed up the process, we consider the use of step size adaptation in both algorithms and show that RLS obtains a 2-approximation in expected polynomial time while the (1+1) EA still encounters a pseudo-polynomial lower bound.

Links and resources

Tags

community

  • @typo3tester
  • @dblp
@typo3tester's tags highlighted