activity
20142023
most citedRuntime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem

1 citations · 1 across the 5 of their papers we have counts for

collaborators
Showing 2016Show all

1 paper · 1 filter

cs.NE2016

Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem

Mojgan Pourhassan, Feng Shi, Frank Neumann

A rigorous runtime analysis of evolutionary multi-objective optimization for the classical vertex cover problem in the context of parameterized complexity analysis has been present…