摘要
0/1背包问题属于动态规划问题,部分背包问题属于贪心算法的范畴,通过比较两种算法的联系和区别,来寻求0/1背包问题的贪心算法的条件,用贪心算法来解决部分0/1背包问题的求解。
The question of 0/1 knapsack is solved through dynamic planning, but part of such a problem can be solved by greedy algorithm. Explaining the differences and similarities of the above two methods, the article aims to elaborate the conditions where the question of 0/1 knapsack can be solved by greedy algorithm.
出处
《鄂州大学学报》
2006年第6期38-40,共3页
Journal of Ezhou University
关键词
动态规划
贪心算法
0/1背包问题
dynamic planning
greedy algorithm
the question of 0/1 knapsack
