Non Deterministic Polynomial Optimization Problems and their Approximations

[1]  Shlomo Moran,et al.  General Approximation Algorithms for some Arithmetical Combinatorial Problems , 1981, Theor. Comput. Sci..

[2]  Ellis Horowitz,et al.  Combinatorial Problems: Reductibility and Approximation , 1978, Oper. Res..

[3]  David S. Johnson,et al.  `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.

[4]  Sartaj Sahni,et al.  General Techniques for Combinatorial Approximation , 1977, Oper. Res..

[5]  Robert E. Tarjan,et al.  Application of a Planar Separator Theorem , 1977, FOCS.

[6]  Eugene L. Lawler,et al.  Parameterized Approximation Scheme for the Multiple Knapsack Problem , 2009, SIAM J. Comput..

[7]  Giorgio Ausiello.  On the Structure and Properties of NP-Complete Problems and Their Associated Optimization Problems , 1977, MFCS.

[8]  Giorgio Ausiello,et al.  On the Structure of Combinatorial Problems and Structure Preserving Reductions , 1977, ICALP.

[9]  Volker Strassen,et al.  A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..

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

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

[12]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems: an annotated bibliography , 1976 .

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

[14]  Sartaj Sahni,et al.  Computationally Related Problems , 1974, SIAM J. Comput..

[15]  David S. Johnson,et al.  Some simplified NP-complete problems , 1974, STOC '74.

[16]  D. E. Knuth,et al.  Postscript about NP-hard problems , 1974, SIGA.

[17]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

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

[19]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[20]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

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

[22]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..