P-Complete Approximation Problems

Journal of the ACM (JACM)

Volumn 23, Issue 3, 1976, Pages 555-565

  Sahni, Sartaj ^a   Gonzalez, Teofilo ^b  

^a UNIVERSITY OF MINNESOTA   (United States)

^b UNIVERSITY OF OKLAHOMA   (United States)

Author keywords

approximation algomthm; cycle covers; general partitions; generalized assignment; integer programming; k max cut; k rain cluster; multicommodlty network flows; P complete; polynomial complexity; quadratic assignment; traveling salesperson

Indexed keywords

COMPUTER METATHEORY - PROGRAMMING THEORY; MATHEMATICAL PROGRAMMING;

COMPUTER PROGRAMMING;

EID: 0016973706     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/321958.321975     Document Type: Article

References (20)

1. Bodin, L D. A graph theoretic approach to the grouping of ordering data. Networks 2 (1972), 307-310.
2. Bruno, J, Coffman, E G, and Sethi, R Scheduling independent tasks to reduce mean finishing-time Comm ACM 17, 7 (July 1974), 382-387.
3. Conway, R W., Maxwell, N.L., and Miller, L W Theory of Scheduling Addison-Wesley, Reading, Mass, 1967.
4. Cook, S A The complexity of theorem-proving procedures Conf. Record of Third ACM Symp on Theory of Computing, 1970, pp 151-158.
5. Garfinkel, R S., and Nemhauser, G L Integer Programming Wiley, New York, 1972.
6. Garey, M R, and Johnson, D S The complexity of near-optimal graph coloring. J ACM 23, 1 (Jan 1976), 43-69.
7. Garey, M R, Johnson, D S, and Stockmeyer, L J Some simplified NP-complete problems Theoretical Comput Sci (to appear).
8. Graham, R L Bounds on multiprocessing timing anomalies SIAM J Appl Math 17, 2 (March 1969), 416-429.
9. Horowitz, E, and Sahni, S Exact and approximate algorithms for scheduling nonidentical processors J ACM 23, 2 (April 1976), 317-327.
10. 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.
11. Johnson, D Approximation algorithms for combinatorial problems. J Comput. Syst Scis 9, 3 (Dec 1974), 256-278.
12. Johnson, D.B., and Lafuente, J.M. A controlled single pass classification algorithm with application to multilevel clustering Scientific Rep #ISR-18, Information Science and Retrieval, Cornell U, Ithaca, N Y, Oct 1970, pp XII-I-XII-37.
13. Karp, R M Reducibility among combinatorial problems In Complexity of Computer Computations, R E Miller and J W Thatcher, Eds, Plenum Press, N Y, 1972, pp 85-104.
14. Knuth, D E. A terminological proposal ACM SIGACT News 6, 1 (Jan 1974), 12-18.
15. Lukes, J A Combinatorial solution to the partitioning of general graphs IBM J Res and Develop 19, 2 (March 1975), 170-180.
16. Rosenkrantz, D J, Stearns, R E, and Lewis, P M Approximate algorithms for the travelling salesperson problem 15th Annual IEEE Symp on Switching and Automata Theory, 1974, pp 3342.
17. Ross, G T, and Soland, R M A branch and bound algorithm for the generalized assignment problem Math Programming 8 (1975), 91-103.
18. Sahni, S. Algorithms for scheduling independent tasks J ACM 23, 1 (Jan 1976), 116-127.
19. Sahni, S Computationally related problems. SIAM J Comput 3, 4 (Dec 1974), pp 262-279.
20. Sahni, S Approximate algorithms for the 0/1 knapsack problem J ACM 22, 1 (Jan 1975), 115-124.