Complexity and approximability issues of Shared Risk Resource Group

In Section 1.1, we describe the problems cited above, why they can be considered as green routing and scheduling problems, their particularity compared to the standard vehicle

Author Index (continued) Rafuse,

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

The approx- imation algorithm is based on the observation that heterozygous columns in binary matrices naturally encode bipartitions of the fragments and that, by Property 2, if

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

Two superadditive cutting plane algorithms (SCPA) and (QSCPA) have been proposed in this paper to solve the minimum cost single-path routing problem.. The first algorithm SCPA is

We show how this problem can be reduced in polynomial time to the set-cover problem so that the known methods of solving the^ set-cover problem can be applied, Several special

Pr ZOUBIR Mohamed* Anesthésie Réanimation Pr TAHIRI My El Hassan* Chirurgie Générale..