Affiliation:
1. Department of Computer and Information Science, Temple University, Philadelphia, PA
Abstract
A natural, and readily computable, first guess at a solution to the coin changing problem is the canonical solution. This solution is a special case of the greedy solution which is a reasonable heuristic guess for the knapsack problem. In this paper, efficient tests are given to determine whether all greedy solutions are optimal with respect to a given set of knapsack objects or coin types. These results improve or extend previous tests given in the literature. Both the incomplete and complete cases are considered.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献