Advertisement

A Characterization of Reductions among Combinatorial Problems

  • G. Ausiello
  • A. D’Atri
  • M. Protasi
Part of the International Centre for Mechanical Sciences book series (CISM, volume 266)

Abstract

In this paper we introduce the concept of convex optimi zation problem associated to an NP-complete set and we study the combinatorial properties of families of such problems. The notion of structure is introduced and through this notion approximability properties and a partial ordering of families of optimization problems are shown.

Keywords

Turing Machine Combinatorial Problem Structure Preserve Finite Graph Input Element 
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]
    G.AUSIELLO, A.D’ATRI, M.PROTASI: On the structure of combinatorial problems and structure preserving reductions. Proc. 4th Int. Coll. on Automata, Languages and Programming Turku, 1977.Google Scholar
  2. [2]
    G.AUSIELLO, A.D’ATRI, M.GAUDIANO, M.PROTASI: Classes of structurally isomorphic NP-optimization problems. Proc. 6th Symp. on Mathematical Foundations of Computer Science, Tatranska Lomnica, 1977.Google Scholar
  3. [3]
    L.BERMAN, J.HARTMANIS: On polynomial time isomorphisms of complete sets. Proc. 3rd GI Conference, Darmstadt, 1977.Google Scholar
  4. [4]
    S.COOK: The complexity of theorems proving procedures. Proc. 3rd ACM Symp. Theory of Computing, 1971.Google Scholar
  5. [5]
    M.R.GAREY, D.S.JOHNSON: The complexity of near-optimal graph coloring. J. of ACM, 23–1, 1976.Google Scholar
  6. [6]
    J.HARTMANIS, L.BERMAN: On isomorphisms and density of NP and other complete sets. Proc. 8th ACM Symp. Theory of Computing, 1976.Google Scholar
  7. [7]
    D.JC±NSON: Approximation algorithms for combinatorial problems. J. of Comp. Syst. Sci, 9,1974.Google Scholar
  8. [8]
    R.M.KARP: Reducibility among combinatorial problems. In complexity of computer computations. R.E.Miller and J.W.Thatcher Eds. Plenum Prees, New York, 1972.Google Scholar
  9. [9]
    S.MORAN, A.PAZ: NP-optimization problems and their approximation. Proc. 4th Int. Coll. on Automata, Languages and Programming, Turku, 1977.Google Scholar
  10. [10]
    S.SAHNI: Algorithms for scheduling independent tasks. J. of ACM, 23–1, 1976.Google Scholar
  11. [11]
    S.SAHNI, T.GONZALES: P-Complete problems and approximate solutions. Proc. IEEE 15th Symp. on Switching and Automata Theory, 1974.Google Scholar
  12. [12]
    J.SIMON: On Some Central Problems in Computational Complexity. Cornell University TR 75–224, 1975.Google Scholar

Copyright information

© Springer-Verlag Wien 1981

Authors and Affiliations

  • G. Ausiello
    • 1
  • A. D’Atri
    • 2
  • M. Protasi
    • 3
  1. 1.Centro di Studio dei Sistemi di Controllo e Calcolo Automatici del CNRRomaItalia
  2. 2.Istituto di Automatica dell’Università di RomaRomaItalia
  3. 3.Istituto di Matematica dell ‘Università dell’AquilaL’AquilaItalia

Personalised recommendations