A note on the inapproximability of the Minimum Monotone Satisfying Assignment problem

HESA is also a hybrid search algorithm [24] that alternates between feasible and infea- sible regions of the search space. HESA relies on a double-crossover recombination method and

all, we prove that the Minimum Duplication problem is APX-hard, even when the input consists of five uniquely leaf-labelled gene trees (improving upon known results on the complexity

First of all, we prove that the Minimum Duplication problem is APX-hard, even when the input consists of five uniquely leaf-labelled gene trees (progressing on the complexity of

Computational results based on randomly generated graphs show that the number of k -branch vertices included in the spanning tree increases with the size of the vertex set V,

Given a graph, this problem consists in finding an isometric cycle with smallest possible eccentricity k.. We show that this problem is NP-Hard and we propose a

nonlinear complementarity problem, Newton method, proximal point method, projection method, global convergence, superlinear convergence.. Note that under this assumption, the

This algorithm combines an original crossover based on the union of independent sets proposed in [1] and local search techniques dedicated to the minimum sum coloring problem

Moreover, when used for xed classes G of graphs having optimum (APSPs) compact routing schemes, the construction of an MDST of G ∈ G may be performed by using interval, linear