Completeness in approximation classes beyond APX

We present a reduction that allows us to establish completeness results for several approximation 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 (1998) 164-191) by proving sufficient conditions for getting complete problems for the whole Log-APX, the class of problems approximable within ratios that are logarithms of the size of the instance, as well as for any approximability class beyond APX. We also introduce a new approximability class, called Poly-APX(Δ), dealing with graph-problems approximable with ratios functions of the maximum degree Δ of the input-graph. For this class also, using the proposed reduction, we establish complete problems.

[1]  Luca Trevisan,et al.  Structure in Approximation Classes , 1999, Electron. Colloquium Comput. Complex..

[2]  P. Orponen,et al.  On Approximation Preserving Reductions: Complete Problems and Robust Measures (Revised Version) , 1987 .

[3]  Rajeev Motwani,et al.  On syntactic versus computational views of approximability , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[4]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[5]  Alessandro Panconesi,et al.  Completeness in Approximation Classes , 1989, Inf. Comput..

[6]  Peter Slavík.  A Tight Analysis of the Greedy Algorithm for Set Cover , 1997, J. Algorithms.

[7]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[8]  Carsten Lund,et al.  Proof verification and the intractability of approximation problems , 1992, FOCS 1992.

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[11]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[12]  Noga Alon,et al.  Derandomized graph products , 1995, computational complexity.

[13]  Vangelis Th. Paschos,et al.  Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness , 2005, Theor. Comput. Sci..

[14]  Luca Trevisan,et al.  On Approximation Scheme Preserving Reducibility and Its Applications , 2000, Theory Comput. Syst..

[15]  Madhu Sudan,et al.  Improved Low-Degree Testing and its Applications , 2003, Comb..