论文信息 - Computational Complexity of Approximation Algorithms for Combinatorial Problems - 字舞流文

Computational Complexity of Approximation Algorithms for Combinatorial Problems

Eugene Levner | George Gens

[1] Teofilo F. Gonzalez,et al. P-Complete Approximation Problems , 1976, J. ACM.

[2] Eugene L. Lawler,et al. Fast approximation algorithms for knapsack problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[3] Oscar H. Ibarra,et al. Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[4] J. K. Lenstra,et al. Interfaces between Computer Sciences and Operations Research. , 1979 .

[5] G. Nemhauser,et al. Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

[6] Sartaj Sahni,et al. Algorithms for Scheduling Independent Tasks , 1976, J. ACM.

[7] W. M. Hirsch,et al. The fixed charge problem , 1968 .