Completeness in Differential Approximation Classes
We study completeness in differential approximability classes. In differential approximation, the quality of an approximation algorithm is the measure of both how far is the solution computed from a worst one and how close is it to an optimal one. The main classes considered are DAPX, the differential counterpart of APX, including the NP optimization problems approximable in polynomial time within constant differential approximation ratio and the DGLO, the differential counterpart of GLO, including problems for which their local optima guarantee constant differential approximation ratio. We define natural approximation preserving reductions and prove completeness results for the class of the NP optimization problems (class NPO), as well as for DAPX and for a natural subclass of DGLO. We also define class 0-APX of the NPO problems that are not differentially approximable within any ratio strictly greater than 0 unless P = NP. This class is very natural for differential approximation, although has no sense for the standard one. Finally, we prove the existence of hard problems for a subclass of DPTAS, the differential counterpart of PTAS, the class of NPO problems solvable by polynomial time differential approximation schemata.
KeywordsPolynomial Time Approximation Ratio Approximation Class Polynomial Time Approximation Schema Approximation Measure
Unable to display preview. Download preview PDF.
- 1.Orponen, P., Mannila, H.: On approximation preserving reductions: complete problems and robust measures. Technical Report C-1987-28, Dept. of Computer Science, University of Helsinki, Finland (1987) Google Scholar
- 5.Crescenzi, P., Trevisan, L.: On approximation scheme preserving reducibility and its applications. In: Thiagarajan, P.S. (ed.) FSTTCS 1994. LNCS, vol. 880, pp. 330–341. Springer, Heidelberg (1994)Google Scholar
- 6.Ausiello, G., D’Atri, A., Protasi, M.: On the structure of combinatorial problems and structure preserving reductions. In: Salomaa, A., Steinby, M. (eds.) ICALP 1977. LNCS, vol. 52. Springer, Heidelberg (1977)Google Scholar
- 8.Ausiello, G., Protasi, M.: NP optimization problems and local optima graph theory. In: Alavi, Y., Schwenk, A. (eds.) Combinatorics and applications. Proc. 7th Quadriennal International Conference on the Theory and Applications of Graphs, vol. 2, pp. 957–975 (1995)Google Scholar
- 10.Ausiello, G., Bazgan, C., Demange, M., Paschos, V.T.: Completeness in differential approximation classes. Cahier du LAMSADE 204, LAMSADE, Université Paris-Dauphine (2003), Available on http://www.lamsade.dauphine.fr/cahiers.html
- 15.Toulouse, S.: Approximation polynomiale: optima locaux et rapport différentiel. PhD thesis, LAMSADE, Université Paris-Dauphine (2001) Google Scholar
- 17.Monnot, J., Paschos, V.T., Toulouse, S.: Optima locaux garantis pour l’approximation differéntielle. Technical Report 203, LAMSADE, Université Paris-Dauphine (2002), Available on http://www.lamsade.dauphine.fr/cahdoc.html#cahiers