From bender@cs.sunysb.edu Thu Nov 14 16:55:23 2002
Date: Thu, 14 Nov 2002 16:55:51 -0500 (EST)
From: Michael Bender <bender@cs.sunysb.edu>
X-X-Sender:  <bender@compserv3>
To: <algorithms-list@cs.sunysb.edu>
Subject: Friday's Reading Group
MIME-Version: 1.0
X-Status: 
X-Keywords:                 


Hi Friends,

Last week, Joe reviewed some of our open problems that we on the table.
We focused on the TSP problem based on Steve's alarm clock.
Specifically, we believe that we have a 3/2-approximation for the "harder"
cases of Steve's problem and a 2-approximation algorithm for the "easier"
cases.  Tomorrow we are going to review these result and try
to improve them.  If were not here last week, do not worry, we will review
the results from the beginning.

I also have a *new* problem to discuss based on exploring unknown
environments, such as graphs and polygonal domains.
I'm particularly excited about this problem.  More details tomorrow!


Michael