Runtime analysis of randomized search heuristics for the dynamic weighted vertex cover problem

Randomized search heuristics such as evolutionary algorithms are frequently applied to dynamic combinatorial optimization problems. Within this paper, we present a dynamic model of the classic Weighted Vertex Cover problem and analyze the performances of the two well-studied algorithms Randomized Local Search and (1+1) EA adapted to it, to contribute to the theoretical understanding of evolutionary computing for problems with dynamic changes. In our investigations, we use an edge-based representation based on the dual formulation of the problem and study the expected runtimes that the two algorithms require to maintain a 2-approximate solution when the given weighted graph is modified by an edge-editing or weight-editing operation. Considering the weights on the vertices may be exponentially large with respect to the size of the graph, the step size adaption strategy is incorporated. Our results show that both algorithms can recompute 2-approximate solutions for the studied dynamic changes efficiently

[1]  Thomas Jansen,et al.  Approximating vertex cover using edge-based representations , 2013, FOGA XII '13.

[2]  Frank Neumann,et al.  Bioinspired computation in combinatorial optimization: algorithms and their computational complexity , 2010, GECCO '12.

[3]  Subhash Khot,et al.  On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[4]  Petros Koumoutsakos,et al.  Reducing the Time Complexity of the Derandomized Evolution Strategy with Covariance Matrix Adaptation (CMA-ES) , 2003, Evolutionary Computation.

[5]  Frank Neumann,et al.  Combinatorial Optimization and Computational Complexity , 2010 .

[6]  Reuven Bar-Yehuda,et al.  A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem , 1981, J. Algorithms.

[7]  Thomas Jansen,et al.  Analyzing Evolutionary Algorithms: The Computer Science Perspective , 2012 .

[8]  Carsten Witt,et al.  Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models , 2007, Evolutionary Computation.

[9]  Mojgan Pourhassan,et al.  Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem , 2016, PPSN.

[10]  Frank Neumann,et al.  What's Hot in Evolutionary Computation , 2017, AAAI.

[11]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[12]  Frank Neumann,et al.  Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem , 2012, Algorithmica.

[13]  Mojgan Pourhassan,et al.  Maintaining 2-Approximations for the Dynamic Vertex Cover Problem Using Evolutionary Algorithms , 2015, GECCO.

[14]  Mojgan Pourhassan,et al.  On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary Algorithms , 2017, FOGA '17.

[15]  Carsten Witt,et al.  (1+1) EA on Generalized Dynamic OneMax , 2015, FOGA.

[16]  Ding-Zhu Du,et al.  Design and Analysis of Approximation Algorithms , 2011 .

[17]  Frank Neumann,et al.  On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling , 2015, IJCAI.

[18]  Frank Neumann,et al.  Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints , 2017, GECCO.

[19]  Benjamin Doerr,et al.  Multiplicative Drift Analysis , 2010, GECCO '10.

[20]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[21]  Hans-Paul Schwefel,et al.  Evolution strategies – A comprehensive introduction , 2002, Natural Computing.

[22]  Anne Auger,et al.  Theory of Randomized Search Heuristics: Foundations and Recent Developments , 2011, Theory of Randomized Search Heuristics.

[23]  Dorit S. Hochbaum,et al.  Efficient bounds for the stable set, vertex cover and set packing problems , 1983, Discret. Appl. Math..