Abstract
In 1996 Khanna and Motwani 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(n2000) are quite common. 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 a fixed-parameter tractable 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 Garey and Johnson.) (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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Cai, L., Fellows, M., Juedes, D. et al. The Complexity of Polynomial-Time Approximation. Theory Comput Syst 41, 459–477 (2007). https://doi.org/10.1007/s00224-007-1346-y
Issue Date:
DOI: https://doi.org/10.1007/s00224-007-1346-y