English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A rigorous runtime analysis of evolutionary multi-objective optimization forthe classical vertex cover problem in the context of parameterized complexityanalysis has been presented by Kratsch and Neumann (2013). In this paper, weextend the analysis to the weighted vertex cover problem and provide a fixedparameter evolutionary algorithm with respect to OPT, the cost of the theoptimal solution for the problem. Moreover, using a diversity mechanisms, wepresent a multi-objective evolutionary algorithm that finds a 2-approximationin expected polynomial time and introduce a population-based evolutionaryalgorithm which finds a $(1+\varepsilon)$-approximation in expected time$O(n\cdot 2^{\min \{n,2(1- \varepsilon)OPT \}} + n^3)$.

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