Fix 'weight' -> 'value' in Knapsack solution 2

2017-04-23 18:48:15 -04:00 · 2017-04-23 18:48:15 -04:00 · 491faeebbd
parent c775c02881
commit 491faeebbd
1 changed files with 1 additions and 1 deletions
--- a/chapter07.tex
+++ b/chapter07.tex
@ -683,7 +683,7 @@ using the following sequence:
 denote the smallest possible total weight
 when a subset of objects
 $1 \ldots k$ is selected such
-that the total weight is $u$.
+that the total value is $u$.
 The solution to the problem is the
 largest value $u$
 for which  $0 \le u \le s$ and $f(n,u) \le x$