Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack

This inherent connection of functional operators (1) with the supremal and inmal convolu- tion of nonlinear mathematics and convex analysis has been extremely fruitful to

Section 3 gathers the necessary conditions of existence for a strategy for the follower (Section 3.1) and for the leader (Section 3.2) for min–max and min–min Stackelberg strategies2.

APX or DAPX: the class of problems for which there exists a polynomial algorithm achieving standard or differential approximation ratio f ( | x | ) where function f is constant (it

We presented a new family of lvm s called m 3 e models that predict the output of a given input as the one that results in the minimum R´enyi entropy of the cor- responding

Par exemple dans (Chen et al., 2004), (Chen et al., 2010) les auteurs s’intéressent à la synthèse d’une commande en boucle fermée (retour d’état) pour stabiliser un

The main objective of this paper is three-fold: (i) to investigate under which additional assumptions on the data of these problems, the unique solutions of systems (1.1) and

Il faut déterminer les formules à écrire dans les cellules D2, E2, F2 , D3 et E3 pour pouvoir les faire glisser vers le bas ( copier-glisser).. Fonctions disponibles (aide au bas

En général, le poids moyen d'un circuit pulsatif n'est ni maximal (comme pour les systèmes max-plus) ni minimal (comme pour les systèmes min-plus).. Sous certaines conditions,