论文信息 - Fast approximation algorithms for knapsack type problems - 字舞流文

Fast approximation algorithms for knapsack type problems

Eugene Levner | George Gens

[1] Sartaj Sahni,et al. Algorithms for Scheduling Independent Tasks , 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] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.

[5] Eugene Levner,et al. Computational Complexity of Approximation Algorithms for Combinatorial Problems , 1979, MFCS.