“Strong” NP-Completeness Results: Motivation, Examples, and Implications

Journal of the ACM (JACM)

Volumn 25, Issue 3, 1978, Pages 499-508

  Garey, M R ^a   Johnson, D S ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

approximation schemes; NP completeness; pseudo polynomial time

Indexed keywords

EID: 84976822151     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/322077.322090     Document Type: Article

References (23)

1. Aho, A V, Hopcroft, J E, and Ullman, J D The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass, 1974.
2. Coffman, E G, and Graham, R L Optimal scheduling for two-processor systems. Acta Informatica I (1972), 200-213.
3. Dantzig, G B Discrete variable extremum problems. Oper Res 5 (1957), 266-277.
4. Garey, M R, and Johnson, D S Complexity results for multiprocessor scheduling under resource constraints SIAM J Comptng. 4 (1975), 397-411.
5. Garey, M R, and Johnson, D S Two processor scheduling with start times and deadlines SIAM J. Comptng 6 (1977), 416-426.
6. Garey, M R, and Johnson, D S The rectilinear Steiner tree problem is NP-complete SIAM J Appi Math. 32 (1977), 826-834.
7. Garey, M R, Johnson, D S, and Sethi, R The complexity of flowshop and jobshop scheduling Math Oper Res 1 (1976), 117-129.
8. Garey, M R, Johnson, D S, and Stockmeyer, L Some simplified NP-complete graph problems Theoret. Comptr Sci 1 (1976), 237-267.
9. Gonzalez, T, and Sahni, S Flow shop and job shop schedules Tech Rep No 75-114, Dept of Comptr Sci, U of Minnesota, Minneapolis, Minn., 1975.
10. Horowitz, E, and Sahni, S Exact and approximate algorithms for scheduling nonidentical processors J. ACM 23, 2 (April 1976), 317-327.
11. Ibarra, O H, AND KIm, C E Fast approximation algorithms for the knapsack and sum of subset problems J. ACM 22, 4 (Oct 1975), 463-468.
12. Johnson, D S, Demers, A, Ullman, J D, Garey, M R, and Graham, R L Worst-case performance bounds for simple one-dimensional packing algorithms SIAM J Comptng 3 (1974), 299-325.
13. Karp, R M Reducibility among combinatorial problems. In Complexity of Computer Computations, R.E. Miller and J W Thatcher, Eds, Plenum Press, New York, 1972, pp 85-104.
14. Karp, R M On the complexity of combinatorial problems Networks 5 (1975), 45-68.
15. Ladner, R E On the structure of polynomial time reducibility J ACM 22, 1 (Jan 1975), 155-171.
16. Lawler, E L A “quasi-polynomial” algorithm for sequencing jobs to minimize total tardiness Memo No ERL-M558, Electron Res. Lab, U. of California, Berkeley, Calif, 1975.
17. Lawler, E.L., AND Moore, J.M. A functional equation and its application to resource allocation and sequencing problems Manage. Sci. 16 (1969), 77-84.
18. Lenstra, J.K., Rinnooy Kan, A H G, and Brucker, P Complexity of machine scheduling problems Annals Discrete Math 1 (1977), 343-362.
19. Nemhauser, G L, and Yu, P.L. A problem in bulk service scheduling Oper Res 20 (1972), 813-819.
20. Papadimitriou, C H, and Steiglitz, K Some complexity results for the traveling salesman problem Proc. 8th Annual ACM Symp on Theory of Comptng, 1976, pp 1-9.
21. Sahni, S. Computationally related problems SIAM J Comptng. 3 (1974), 262-279.
22. Sahni, S Algorithms for scheduling independent tasks J A CM 23, 1 (Jan 1976), 116-127.
23. Ullman, J D NP-complete scheduling problems. J Comptr Syst Sci 10 (1975), 384-393.