Two linear approximation algorithms for the subset-sum problem
暂无分享,去创建一个
[1] Ellis Horowitz,et al. Computing Partitions with Applications to the Knapsack Problem , 1974, JACM.
[2] Tsung-Chyan Lai. Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems , 1993, Oper. Res. Lett..
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] S. Martello,et al. A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem , 1984 .
[5] Matteo Fischetti. A new linear storage, polynomial-time approximation scheme for the subset-sum problem , 1990, Discret. Appl. Math..
[6] J. H. Ahrens,et al. Merging and Sorting Applied to the Zero-One Knapsack Problem , 1975, Oper. Res..
[7] Bruce Faaland. Technical Note - Solution of the Value-Independent Knapsack Problem by Partitioning , 1973, Oper. Res..
[8] Paolo Toth,et al. Worst-case analysis of greedy algorithms for the subset-sum problem , 1984, Math. Program..
[9] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .