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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
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.
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.
L.BERMAN, J.HARTMANIS: On polynomial time isomorphisms of complete sets. Proc. 3rd GI Conference, Darmstadt, 1977.
S.COOK: The complexity of theorems proving procedures. Proc. 3rd ACM Symp. Theory of Computing, 1971.
M.R.GAREY, D.S.JOHNSON: The complexity of near-optimal graph coloring. J. of ACM, 23–1, 1976.
J.HARTMANIS, L.BERMAN: On isomorphisms and density of NP and other complete sets. Proc. 8th ACM Symp. Theory of Computing, 1976.
D.JC±NSON: Approximation algorithms for combinatorial problems. J. of Comp. Syst. Sci, 9,1974.
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.
S.MORAN, A.PAZ: NP-optimization problems and their approximation. Proc. 4th Int. Coll. on Automata, Languages and Programming, Turku, 1977.
S.SAHNI: Algorithms for scheduling independent tasks. J. of ACM, 23–1, 1976.
S.SAHNI, T.GONZALES: P-Complete problems and approximate solutions. Proc. IEEE 15th Symp. on Switching and Automata Theory, 1974.
J.SIMON: On Some Central Problems in Computational Complexity. Cornell University TR 75–224, 1975.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer-Verlag Wien
About this chapter
Cite this chapter
Ausiello, G., D’Atri, A., Protasi, M. (1981). A Characterization of Reductions among Combinatorial Problems. In: Ausiello, G., Lucertini, M. (eds) Analysis and Design of Algorithms in Combinatorial Optimization. International Centre for Mechanical Sciences, vol 266. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2748-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-7091-2748-3_2
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81626-4
Online ISBN: 978-3-7091-2748-3
eBook Packages: Springer Book Archive