Homework 6 question 2 question.

R. Clayton (rclayton@monmouth.edu)
Tue, 18 Apr 2000 09:38:32 -0400 (EDT)

• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
• Next message: R. Clayton: "The greedy-choice property for Huffman's algorithm."
• Previous message: R. Clayton: "The halting problem, take 2."

  In question 2, do we have to worry about fractional slices?

No; use only whole slices to make the sub.

  I am thinking this problem is related to the knapsack 0-1 problem.

That's correct with respect to not allowing fractional parts, but knapsack
problems are maximization problems (maximize cost) while this problem is a
minimization problem (minimize the number of slices).

• Next message: R. Clayton: "The greedy-choice property for Huffman's algorithm."
• Previous message: R. Clayton: "The halting problem, take 2."

This archive was generated by hypermail 2.0b3 on Wed Apr 26 2000 - 09:35:05 EDT