Advertisement

On the structure and properties of NP-complete problems and their associated optimization problems

  • Giorgio Ausiello
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)

Abstract

1. INTRODUCTION

2. ON THE ISOMORPHISM OF NP-COMPLETE COMBINATORIAL PROBLEMS

3. NP OPTIMIZATION PROBLEMS AND THEIR APPROXIMATION

4. CHARACTERIZATIONS OF CLASSES OF OPTIMIZATION PROBLEMS

Keywords

Approximation Algorithm Polynomial Time Turing Machine Combinatorial Problem Approximate Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. 1.
    A.AIELLO, E.BURATTINI, A.MASSAROTTI, F.VENTRIGLIA: Toward a general principle of evaluation for approximate algorithms. In Séminaires IRIA, Parigi, Francia, 1976.Google Scholar
  2. 2.
    G.AUSIELLO, A.D'ATRI, M.PROTASI: A characterization of reductions among combinatorial problems. R. 76–23, Istituto di Automatica, Università di Roma, 1976.Google Scholar
  3. 3.
    G.AUSIELLO, A.D'ATRI, M.PROTASI: On the structure of combinatorial problems and structure preserving reductions. Proc. 4 th International Colloquium on Automata, Languages and Programming, Turku, Finland, 1977a.Google Scholar
  4. 4.
    G.AUSIELLO, A.D'ATRI, M.GAUDIANO, M.PROTASI: Classes of structurally isomorphic NP optimization problems. These proceedings 1977b.Google Scholar
  5. 5.
    T. BAKER, J. GILL, R. SOLOVAY: Relativizations of the P = ? NP question. SIAM J. on Computing, 4, 4, 1975.Google Scholar
  6. 6.
    L.BERMAN, J.HARTMANIS: On polynomial time isomorphisms of complete sets. 3 rd GI Conference on Theoretical Computer Science, Darmstadt, Germany, 1977.Google Scholar
  7. 7.
    S.COOK: The complexity of theorem proving procedures. Proc. 3 rd Annual ACM Symposium on Theory of Computing, Shaker Heights, Ohio, USA, 1971.Google Scholar
  8. 8.
    M.R. GAREY, D.S. JOHNSON: The complexity of near optimal graph coloring. J. ACM, 23, 1, 1976a.CrossRefGoogle Scholar
  9. 9.
    M.R.GAREY, D.S.JOHNSON: Approximation algorithms for combinatorial problems: an annotated bibliography. Proc. Symposium on Algorithms and Complexity: New directions and recent results, Pittsburg, Pa, USA, 1976b.Google Scholar
  10. 10.
    J.HARTMANIS, L.BERMAN: On isomorphism and density of NP and other complete sets. Proc. 8 th Annual ACM Symposium on Theory of Computing, Hershey, Pa., USA, 1976.Google Scholar
  11. 11.
    J.HARTMANIS, J.E.HOPCROFT: Independence results in computer science. TR, Department of Computer Science, Cornell University, Ithaca, N.Y., USA, 1976.Google Scholar
  12. 12.
    J.HARTMANIS, J.SIMON: On the structure of feasible computations. In Advances in Computers, Vol. 14, Academic Press, N.Y., 1976.Google Scholar
  13. 13.
    O.H. IBARRA, C.E. KIM: Fast approximation algorithms for the Knapsack and sum of subsets problems. J. ACM, 22, 4, 1975.CrossRefGoogle Scholar
  14. 14.
    D.S. JOHNSON: Approximation algorithms for combinatorial problems. J. Computers and Systems Science, 9, 3, 1974.Google Scholar
  15. 15.
    R.KARP: Reducibilities among combinatorial problems. In Complexity of Computer Computations, Plenum Press, 1972.Google Scholar
  16. 16.
    C.H.PAPADIMITRIOU, K.STEIGLITZ: Some complexity results for the traveling salesman problem. Proc. 8 th Annual ACM Symposium on Theory of Computing, Hershey, Pa., USA, 1976.Google Scholar
  17. 17.
    A.PAZ, S.MORAN: Non-deterministic polynomial optimization problems and their approximation. Proc. 4 th International Colloquium on Automata, Languages and Programming, Turku, Finland, 1977.Google Scholar
  18. 18.
    S. SAHNI: Approximate algorithms for the 0–1 Knapsack problem. J. ACM, 22 1, 1975.CrossRefGoogle Scholar
  19. 19.
    S. SAHNI: Algorithms for scheduling independent tasks. J. ACM, 23, 1, 1976.CrossRefGoogle Scholar
  20. 20.
    S. SAHNI, T. GONZALES: P-complete approximation problems. J. ACM, 23, 3, 1976.Google Scholar
  21. 21.
    J.SIMON: On some central problems in computational complexity. TR 75–224, Department of Computer Science, Cornell University, Ithaca, N.Y., USA, 1975.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Giorgio Ausiello
    • 1
  1. 1.CSSCCA-CNRRomaItaly

Personalised recommendations