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
Preview
Unable to display preview. Download preview PDF.
Bibliography
A.AIELLO, E.BURATTINI, A.MASSAROTTI, F.VENTRIGLIA: Toward a general principle of evaluation for approximate algorithms. In Séminaires IRIA, Parigi, Francia, 1976.
G.AUSIELLO, A.D'ATRI, M.PROTASI: A characterization of reductions among combinatorial problems. R. 76–23, Istituto di Automatica, Università di Roma, 1976.
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.
G.AUSIELLO, A.D'ATRI, M.GAUDIANO, M.PROTASI: Classes of structurally isomorphic NP optimization problems. These proceedings 1977b.
T. BAKER, J. GILL, R. SOLOVAY: Relativizations of the P = ? NP question. SIAM J. on Computing, 4, 4, 1975.
L.BERMAN, J.HARTMANIS: On polynomial time isomorphisms of complete sets. 3 rd GI Conference on Theoretical Computer Science, Darmstadt, Germany, 1977.
S.COOK: The complexity of theorem proving procedures. Proc. 3 rd Annual ACM Symposium on Theory of Computing, Shaker Heights, Ohio, USA, 1971.
M.R. GAREY, D.S. JOHNSON: The complexity of near optimal graph coloring. J. ACM, 23, 1, 1976a.
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.
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.
J.HARTMANIS, J.E.HOPCROFT: Independence results in computer science. TR, Department of Computer Science, Cornell University, Ithaca, N.Y., USA, 1976.
J.HARTMANIS, J.SIMON: On the structure of feasible computations. In Advances in Computers, Vol. 14, Academic Press, N.Y., 1976.
O.H. IBARRA, C.E. KIM: Fast approximation algorithms for the Knapsack and sum of subsets problems. J. ACM, 22, 4, 1975.
D.S. JOHNSON: Approximation algorithms for combinatorial problems. J. Computers and Systems Science, 9, 3, 1974.
R.KARP: Reducibilities among combinatorial problems. In Complexity of Computer Computations, Plenum Press, 1972.
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.
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.
S. SAHNI: Approximate algorithms for the 0–1 Knapsack problem. J. ACM, 22 1, 1975.
S. SAHNI: Algorithms for scheduling independent tasks. J. ACM, 23, 1, 1976.
S. SAHNI, T. GONZALES: P-complete approximation problems. J. ACM, 23, 3, 1976.
J.SIMON: On some central problems in computational complexity. TR 75–224, Department of Computer Science, Cornell University, Ithaca, N.Y., USA, 1975.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ausiello, G. (1977). On the structure and properties of NP-complete problems and their associated optimization problems. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_123
Download citation
DOI: https://doi.org/10.1007/3-540-08353-7_123
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08353-5
Online ISBN: 978-3-540-37285-1
eBook Packages: Springer Book Archive