summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorThibaut Horel <thibaut.horel@gmail.com>2014-11-05 13:19:42 -0500
committerThibaut Horel <thibaut.horel@gmail.com>2014-11-05 13:19:42 -0500
commit27ad83b1a951a26a431c5aabbb6a5cd21430a516 (patch)
tree99ef5976edc809ddfd6d55cc0d107f62830fad83
parent8ba603ed8a064633e3a7940b435efcbf3b2ac415 (diff)
downloadcs224-27ad83b1a951a26a431c5aabbb6a5cd21430a516.tar.gz
[ps5] Typo fix for official solutions
-rw-r--r--ps5/main.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/ps5/main.tex b/ps5/main.tex
index 7ebda39..662ffa1 100644
--- a/ps5/main.tex
+++ b/ps5/main.tex
@@ -174,7 +174,7 @@ we obtained an allocation of the jobs in $B$ of load $L\leq
(1+\eps)\text{OPT}$.
We can then complete the allocation by greedily allocation jobs in $S$, by
-question \textbf{(c)} this loads to a load bounded by $\max\{L,
+question \textbf{(c)} this leads to a load bounded by $\max\{L,
(1+\eps)\text{OPT}\} = (1+\eps)\text{OPT}$ since we have just proved that
$L\leq(1+\eps)\text{OPT}$.