Poly-APX- and PTAS-Completeness in standard and differential approximation

  • Authors:

  • Cristina Bazgan;Bruno Escoffier;Vangelis Th. Paschos

  • Affiliations:

  • LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France;LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France;LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France

  • Venue:
  • ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We first prove the existence of natural Poly-APX-complete problems, for both standard and differential approximation paradigms, under already defined and studied suitable approximation preserving reductions Next, we devise new approximation preserving reductions, called FT and DFT, respectively, and prove that, under these reductions, natural problems are PTAS-complete, always for both standard and differential approximation paradigms To our knowledge, no natural problem was known to be PTAS-complete and no problem was known to be Poly-APX-complete until now We also deal with the existence of intermediate problems under FT- and DFT-reductions and we show that such problems exist provided that there exist NPO-intermediate problems under Turing-reduction Finally, we show that min coloring is APX-complete for the differential approximation.