Recent Developments on the Approximability of Combinatorial Problems

Research during the last few years is finally succeeding in shedding light on the limitations in the approximation of many important combinatorial optimization problems. The talk will survey the approximability picture that has emerged so far. In the paper we give a brief summary.

[1]  Avrim Blum,et al.  Some tools for approximate 3-coloring , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[2]  Giorgio Ausiello,et al.  Structure Preserving Reductions among Convex Optimization Problems , 1980, J. Comput. Syst. Sci..

[3]  Mihalis Yannakakis,et al.  The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems , 1979, JACM.

[4]  Piotr Berman,et al.  On the Complexity of Approximating the Independent Set Problem , 1989, Inf. Comput..

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

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

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

[8]  Sartaj Sahni,et al.  Approximate Algorithms for the 0/1 Knapsack Problem , 1975, JACM.

[9]  David S. Johnson,et al.  Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .

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

[11]  Mihalis Yannakakis,et al.  On the approximation of maximum satisfiability , 1992, SODA '92.

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

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

[14]  Uriel Feige,et al.  Two prover protocols: low error at affordable rates , 1994, STOC '94.

[15]  Desh Ranjan,et al.  Quantifiers and approximation , 1990, STOC '90.

[16]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[17]  László Babai,et al.  Transparent Proofs and Limits to Approximation , 1994 .

[18]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1993, STOC.

[19]  Carsten Lund,et al.  The Approximation of Maximum Subgraph Problems , 1993, ICALP.

[20]  David S. Johnson.  The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.

[21]  Oscar H. Ibarra,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[22]  Mihir Bellare,et al.  Interactive proofs and approximation: reductions from two provers in one round , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[23]  Robert W. Irving.  On Approximating the Minimum Independent Dominating Set , 1991, Inf. Process. Lett..

[24]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

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

[26]  László Lovász,et al.  Two-prover one-round proof systems: their power and their problems (extended abstract) , 1992, STOC '92.

[27]  Shlomo Moran,et al.  Non Deterministic Polynomial Optimization Problems and their Approximations , 1977, Theor. Comput. Sci..

[28]  Carsten Lund,et al.  Nondeterministic exponential time has two-prover interactive protocols , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[29]  Shlomo Moran,et al.  Non Deterministic Polynomial Optimization Problems and their Approximations , 1977, Theoretical Computer Science.

[30]  Hans Ulrich Simon,et al.  On Approximate Solutions for Combinatorial Optimization Problems , 1990, SIAM J. Discret. Math..

[31]  Giorgio Ausiello,et al.  Toward a Unified Approach for the Classification of NP-Complete Optimization Problems , 1979, Theor. Comput. Sci..

[32]  Mihir Bellare,et al.  The complexity of approximating a nonlinear program , 1995, Math. Program..

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

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

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

[36]  David R. Karger,et al.  On Approximating the Longest Path in a Graph (Preliminary Version) , 1993, WADS.

[37]  Carsten Lund,et al.  Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.

[38]  David Zuckerman,et al.  NP-complete problems have a version that's hard to approximate , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.