Classes of structurally isomorphic np-optimization problems

  • Giorgio Ausiello
  • Alessandro D'Atri
  • Marco Gaudiano
  • Marco Protasi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)


Input Element Polynomial Time Computable Function Associate Optimization Problem Time Computable Function Feedback Node 
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.


  1. [1]
    A. AIELLO, E. BURATTINI, A. MASSAROTTI, F. VENTRIGLIA: Towards a general principle of evaluation for approximate algorithms. Seminaries IRIA, 1976.Google Scholar
  2. [2]
    G. AUSIELLO: On the structure and properties of NP-complete problems and their associated optimization problems. This volume.Google Scholar
  3. [3]
    G. AUSIELLO, A. D'ATRI, M. PROTASI: On the structure of combinatorial problems and structure preserving reductions. 4 th ICALP, Turku, Finland, 1977.Google Scholar
  4. [4]
    R.M. KARP: Reducibility among combinatorial problems, in "Complexity of computer computations". R.E. Miller and J.W. Thatcher Eds., Plenum Press, New York, 1972.Google Scholar
  5. [5]
    S. MORAN, A. PAZ: NP optimization problems and their approximation. 4 th ICALP, Turku, Finland, 1977.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Giorgio Ausiello
    • 1
  • Alessandro D'Atri
    • 2
  • Marco Gaudiano
    • 2
  • Marco Protasi
    • 3
  1. 1.CSSCCA-CNRRomaItaly
  2. 2.Istituto di Automatica dell'Università di RomaItaly
  3. 3.Istituto di Matematica dell'Università di RomaItaly

Personalised recommendations