From 27ad83b1a951a26a431c5aabbb6a5cd21430a516 Mon Sep 17 00:00:00 2001
From: Thibaut Horel <thibaut.horel@gmail.com>
Date: Wed, 5 Nov 2014 13:19:42 -0500
Subject: [ps5] Typo fix for official solutions

---
 ps5/main.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

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}$.
 
-- 
cgit v1.2.3-70-g09d2