Completeness in approximation classes beyond APX - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2005

Completeness in approximation classes beyond APX

Résumé

We present a reduction that allows us to establish completeness results for several ap- proximation classes mainly beyond APX. Using it, we extend one of the basic results of S. Khanna, R. Motwani, M. Sudan, and U. Vazirani (On syntactic versus computational views of approximability, SIAM J. Comput., 28:164 191, 1998) by proving the existence of complete problems for the whole Log-APX, the class of problems approximable within ra- tios that are logarithms of the size of the instance. We also introduce a new approximability class, called Poly-APX(Δ ), dealing with graph-problems approximable with ratios func- tions of the maximum degree Δ of the input graph. For this class also, using the reduction propose, we establish complete problems.
Fichier principal
Vignette du fichier
cahier_225.pdf (257.62 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00958036 , version 1 (11-03-2014)

Identifiants

  • HAL Id : hal-00958036 , version 1

Citer

Bruno Escoffier, Vangelis Paschos. Completeness in approximation classes beyond APX. 2005. ⟨hal-00958036⟩
89 Consultations
246 Téléchargements

Partager

Gmail Facebook X LinkedIn More