Taking domain knowledge into account is a long-standing issue in AI, especially nowadays
where huge amounts of data are collected in the hope of delivering new in-sights and value …

The minimum vertex cover problem is a basic combinatorial optimization problem. Given an
undirected graph the objective is to determine a subset of the vertices which covers all …

We present in this paper an experimental study of six heuristics for a well-studied NP-
complete graph problem: the vertex cover. These algorithms are adapted to process huge …

Graph related problems mostly belong to NP class and minimum vertex cover is one of them.
Minimum vertex cover is focus point for researchers since last decade due to its vast areas of …

Given a vertex-weighted undirected graph, to find the vertex cover of minimum weight is
called minimum weight vertex cover problem (MWVCP). It is known as an NP-hard problem …

Given an undirected graph $\GG=(\VV,\EE) $, with vertex weights $(w (u)) _ {u\in\VV} $,
vertex values $(\alpha (u)) _ {u\in\VV} $, a knapsack size $ s $, and a target value $ d …

The vertex cover is a classical NP-complete problem that has received great attention these
last decades. A conjecture states that there is no c-approximation polynomial algorithm for it …

Numerous approximation algorithms have been presented by researchers for approximation
of minimum vertex cover, all of these approaches have deficiencies in one way or another …

In this dissertation, we investigate the link between domain knowledge in the form of
functions and data science. Consider the following scenario. Let D (y, z1,..., zn) be a dataset …

Complete optimization problem. The importance of MVC in theory and practical comes from
the wide range of its applications. This paper describes a polynomial time greedy algorithm …