Publisher
Springer Berlin Heidelberg
Reference52 articles.
1. Graham, R.: Bounds for certain multiprocessor anomalics. Bell System Technical Journal 45 (1966), pp. 1563–1581.
2. Cook, S. A.: The complexity of theorem proving procedures. In: Proc. 3rd ACM STOC, ACM, 1971, pp. 151–158.
3. Johnson, D. S.: Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9 (1974), 256–289.
4. Sahni, S., Gonzales, T.: P-complete approximation problems. Journal of the ACM 23 (1976), 555–565.
5. Christofides, N.: Worst case analysis of a new heuristic for the travelling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsbourgh, 1976.