Discrete Applied Mathematics

As we explained before the minimum delay of the traffic is equal to the time needed to send this packet from the station to the QAP without retransmission, so it is independent from

It is known that large fragments of the class of dense Minimum Constraint Sat- isfaction (MIN-CSP) problems do not have polynomial time approximation schemes (PTASs) contrary to

It is known that a maximum independent set of a graph on n vertices can be computed in O(1.4423 n ) time by combining a result due to Moon and Moser, who showed in 1965 that the

Next, Section 3.5 concerns the specific properties [11,20] that allow us to avoid the full construction of the hypercube search space. Section 3.6 presents the polynomial-time

Motivated by problems of uncertainty propagation and robust estimation we are interested in computing a polynomial sublevel set of fixed degree and minimum volume that contains a

We show that the decision versions of the minimum cover and partition by γ-quasi-cliques problems are NP-complete for any fixed γ satisfying 0 < γ < 1.. Key-words:

In this framework, we derive however a result that is absent from the literature in the case of the control of continuous-time Markov chains on discrete state spaces: that of

En effet, Selon notre connaissance dans la ville Mostaganem, nous avons constaté globalement l’absence d’un Système d’Information Géographique et d’un processus