We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
We consider parameterized problems where some separation property has to be achieved by deleting as few vertices as possible. The following five problems are studied: delete k ve...
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...