Optima locaux garantis pour l'approximation différentielle
Résumé
We first introduce the class DGLO; it includes optimization problems that guaranty the quality of their local optima, with respect to the differential approximation ratio. Next, we show that a certain number of well-known combinatorial problems belong to this class, while other ones do not. Finally, based upon the results obtained, we place DGLO in the scene of the approximability classes.