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

No abstract is available for this paper.

• Publication year

  2017

• Venue

  Foundations of Genetic Algorithms

• Publication date

  2017-01-12

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/3040718.3040726
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Approximation Algorithms

  2021cited by this paper
• k-Bit Mutation with Self-Adjusting k Outperforms Standard Bit Mutation

  2016cited by this paper
• The Right Mutation Strength for Multi-Valued Decision Variables

  2016cited by this paper
• Self-adaptation of Mutation Rates in Non-elitist Populations

  2016cited by this paper
• (1+1) EA on Generalized Dynamic OneMax

  2015cited by this paper
• Analyzing Evolutionary Algorithms

  2015cited by this paper
• Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th Rule in Discrete Settings

  2015cited by this paper
• Approximating vertex cover using edge-based representations

  2013influential reference
• Analyzing Evolutionary Algorithms: The Computer Science Perspective

  2012cited by this paper
• Erratum: Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation

  2012influential reference
• Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet

  2012cited by this paper
• Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets

  2011cited by this paper
• Adaptive population models for offspring populations and parallel evolutionary algorithms

  2011cited by this paper
• Design and Analysis of Approximation Algorithms

  2011cited by this paper
• Theory of Randomized Search Heuristics: Foundations and Recent Developments

  2011cited by this paper
• Multiplicative Drift Analysis

  2010cited by this paper
• Bioinspired computation in combinatorial optimization: algorithms and their computational complexity

  2010cited by this paper
• Bioinspired Computation in Combinatorial Optimization

  2010cited by this paper
• Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem

  2010cited by this paper
• Analysis of the $(1+1)$-EA for Finding Approximate Solutions to Vertex Cover Problems

  2009cited by this paper
• Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem

  2009cited by this paper
• Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem

  2009cited by this paper
• Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation

  2008cited by this paper
• Rigorous analyses of fitness-proportional selection for optimizing linear functions

  2008cited by this paper
• Parameter Control in Evolutionary Algorithms

  2007cited by this paper
• Reducing the Time Complexity of the Derandomized Evolution Strategy with Covariance Matrix Adaptation (CMA-ES)

  2003cited by this paper
• Evolution strategies – A comprehensive introduction

  2002cited by this paper
• Drift analysis and average time complexity of evolutionary algorithms

  2001cited by this paper
• Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions

  2001cited by this paper
• Random Walks on ℤ

  1988cited by this paper
• A Modification of the Greedy Algorithm for Vertex Cover

  1983cited by this paper
• A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem

  1981cited by this paper
• Random walks, universal traversal sequences, and the complexity of maze problems

  1979cited by this paper
• An Introduction to Probability Theory and Its Applications

  1967cited by this paper
• An Introduction to Probability Theory and Its Applications

  1959cited by this paper

• Dual Algorithmic Reasoning

  2023influential citation
• The $(1+(\lambda,\lambda))$ Genetic Algorithm on the Vertex Cover Problem: Crossover Helps Leaving Plateaus

  2022cites this paper
• Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem

  2022cites this paper
• A Metaheuristic Algorithm for Vertex Cover based Link Monitoring and Backbone Formation in Wireless Ad hoc Networks

  2022cites this paper
• Publications of Tobias Friedrich

  2021cites this paper
• Weighted Connected Vertex Cover Based Energy-Efficient Link Monitoring for Wireless Sensor Networks Towards Secure Internet of Things

  2021cites this paper
• Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem

  2021cites this paper
• Time Complexity Analysis of Evolutionary Algorithms for 2-Hop (1, 2)-Minimum Spanning Tree Problem

  2021cites this paper
• Publications of Tobias Friedrich

  2021cites this paper
• Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem

  2020influential citation
• VERTEX COVER BASED LINK MONITORING TECHNIQUES FOR WIRELESS SENSOR NETWORKS

  2020cites this paper
• Runtime analysis of evolutionary algorithms for the depth restricted (1,2)-minimum spanning tree problem

  2019cites this paper
• Runtime Analysis of RLS and (1+1) EA for the Dynamic Weighted Vertex Cover Problem

  2019cites this paper
• Runtime analysis of randomized search heuristics for the dynamic weighted vertex cover problem

  2018influential citation
• Improved runtime analysis of RLS and (1+1) EA for the dynamic vertex cover problem

  2017cites this paper