The hardness of approximation: Gap location

We refine the complexity analysis of approximation problems by relating it to a new parameter calledgap location. Many of the results obtained so far for approximations yield satisfactory analysis with respect to this refined parameter, but some known results (e.g.,max-k-colorability, max 3-dimensional matching andmax not-all-equal 3sat) fall short of doing so. As a second contribution, our work fills the gap in these cases by presenting new reductions.Next, we present definitions and hardness results of new approximation versions of some NP-complete optimization problems. The problems we treat arevertex cover (for which we define a different optimization problem from the one treated in Papadimitriou & Yannakakis 1991),k-edge coloring, andset splitting.

[1]  Miklós Ajtai,et al.  Recursive construction for 3-regular expanders , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[2]  Larry Stockmeyer,et al.  Planar 3-colorability is polynomial complete , 1973, SIGA.

[3]  David S. Johnson,et al.  Stockmeyer: some simplified np-complete graph problems , 1976 .

[4]  Erez Petrank,et al.  The hardness of approximation: Gap location , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[5]  Mihalis Yannakakis,et al.  The complexity of multiway cuts (extended abstract) , 1992, STOC '92.

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

[7]  David S. Johnson,et al.  The Complexity of Near-Optimal Graph Coloring , 1976, J. ACM.

[8]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[9]  Zvi Galil,et al.  Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..

[10]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[11]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[12]  Sanjeev Arora,et al.  Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[13]  Vojtech Rödl,et al.  The algorithmic aspects of the regularity lemma , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[14]  Mihalis Yannakakis,et al.  The Traveling Salesman Problem with Distances One and Two , 1993, Math. Oper. Res..

[15]  Marshall W. Bern,et al.  The Steiner Problem with Edge Lengths 1 and 2 , 1989, Inf. Process. Lett..

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

[17]  Tao Jiang,et al.  Linear approximation of shortest superstrings , 1991, STOC '91.

[18]  László Lovász,et al.  Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[19]  Johan Håstad,et al.  A well-characterized approximation problem , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[20]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[21]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[22]  Viggo Kann,et al.  Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete , 1991, Inf. Process. Lett..

[23]  Rajeev Motwani,et al.  Lecture notes on approximation algorithms: Volume I , 1993 .

[24]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

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

[26]  Zvi Galil,et al.  NP Completeness of Finding the Chromatic Index of Regular Graphs , 1983, J. Algorithms.