论文信息 - Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses - 字舞流文

Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses

A. Frieze | M. Clarke

[1] P. Gács,et al. Khachiyan’s algorithm for linear programming , 1981 .

[2] Rainer Schrader,et al. ON THE EXISTENCE OF FAST APPROXIMATION SCHEMES , 1981 .

[3] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .

[4] P. Gács,et al. Khachian's Algorithm for Linear Programming. , 1979 .

[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6] Eugene L. Lawler,et al. Parameterized Approximation Scheme for the Multiple Knapsack Problem , 2009, SIAM J. Comput..

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

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

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

[10] J. Spencer. Probabilistic Methods in Combinatorics , 1974 .

[11] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.