论文信息 - ON THE EXISTENCE OF FAST APPROXIMATION SCHEMES - 字舞流文

ON THE EXISTENCE OF FAST APPROXIMATION SCHEMES

Rainer Schrader | Bernhard Korte | B. Korte | R. Schrader

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

[2] Sartaj Sahni,et al. Approximate Algorithms for the 0/1 Knapsack Problem , 1975, JACM.

[3] Chak-Kuen Wong,et al. Approximate Algorithms for Some Generalized Knapsack Problems , 1976, Theor. Comput. Sci..

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

[5] Ellis Horowitz,et al. Exact and Approximate Algorithms for Scheduling Nonidentical Processors , 1976, JACM.

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

[7] Sartaj Sahni,et al. General Techniques for Combinatorial Approximation , 1977, Oper. Res..

[8] Oscar H. Ibarra,et al. Approximation Algorithms for Certain Scheduling Problems , 1978, Math. Oper. Res..

[9] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[10] Bernhard Korte,et al. Lower bounds on the worst-case complexity of some oracle algorithms , 1978, Discret. Math..