Fixed typos, updated abstract.

diff --git a/events.xml b/events.xml
index 9f2e0c2..9ac9d7c 100644 (file)
--- a/events.xml
+++ b/events.xml
@@ -29,20 +29,19 @@
 </eventitem>
 
 <eventitem date="2014-10-22" time="5:00 PM" room="MC 4041"
-           title="In Persuit of the Traveling Salesman">
+           title="In Pursuit of the Travelling Salesman">
   <short>
     <p>
-        Bill Cook is giving a talk about the Traveling Salesman.
-The problem is easy to state: given a number of cities along with the cost of
-travel between each pair of them, find the cheapest way to visit all of them
-and return to your starting point.  Easy to state but difficult to solve.  In
-this talk we discuss the history, applications, and computation of this
+        The Travelling Salesman Problem is easy to state: given a number of 
+cities along with the cost of travel between each pair, find the cheapest way 
+to visit all of the cities and return to your starting point.  However, TSP is very  difficult to solve. 
+In this talk, Professor Bill Cook will  discuss the history, applications, and computation of this
 fascinating problem.
     </p>
   </short>
   <abstract>
     <p>
-        The traveling salesman problem is easy to state: given a
+        The Travelling Salesman Problem is easy to state: given a
         number of cities along with the cost of travel between each
         pair of them, find the cheapest way to visit them all and
         return to your starting point.  Easy to state, but