DMCA
The Complexity of Polynomial-Time Approximation (2006)
| Venue: | TO APPEAR IN JOURNAL THEORY OF COMPUTING SYSTEMS |
| Citations: | 6 - 0 self |
BibTeX
@MISC{Cai06thecomplexity,
author = {Liming Cai and Michael Fellows and David Juedes and Frances Rosamond},
title = { The Complexity of Polynomial-Time Approximation },
year = {2006}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental problems might provide insight into characterizing the class of optimization problems that admit a polynomial-time approximation scheme (PTAS). The main contribution of this paper is to explore this program from the point of view of parameterized complexity. Problems of optimization are naturally parameterized by the parameter k = 1/ɛ. An optimization problem admits a PTAS if and only if there is an algorithm Φ, that, given an input of size n, and a parameter value k = 1/ɛ, produces a solution that is within a multiplicative factor of (1 + ɛ) of optimal, in a running time that is polynomial for every fixed value of ɛ. This definition admits the possibility that the degree of the polynomial that bounds the running time of Φ may increase, even quite dramatically, as a function of k = 1/ɛ. In fact, amongst the PTASs that are currently known, for an error of 20%, polynomial time bounds no better than O(n 2000) are quite common [Dow03]. Viewing k = 1/ɛ as a problem parameter, in the sense of parameterized complexity, leads naturally to the question of whether an efficient PTAS (EPTAS) might be possible for a given optimization problem. An EPTAS is simply an FPT algorithm with respect to this parameter. We offer a number of results concerning the problems Planar TMIN, Planar TMAX and Planar MPSAT defined by Khanna and Motwani: (1) We show that each of these problems of approximation, naturally parameterized by k = 1/ɛ, is hard for W [1], and thus it is highly unlikely that they admit EPTASs. (One could also interpret this as indicating that PTASs for these problems are unlikely to be a useful way of coping with intractability in the sense of [GJ79].) (2) We show that there are EPTASs for some subproblems described by syntactic restrictions, and establish some limits on how far these positive results can be extended.
Keyphrases
optimization problem polynomial-time approximation running time parameterized complexity parameter value efficient ptas polynomial time quite common dow03 motwani km96 polynomial-time approximation scheme problem parameter planar tmax planar structure multiplicative factor planar mpsat main contribution syntactic restriction fpt algorithm logic-based optimization problem problem planar tmin positive result fixed value fundamental problem useful way
