From fredh Sun Mar 21 19:43:04 1993
Return-Path: <fredh>
Received: from einstein.cs.clemson.edu by cs.clemson.edu (4.1/SMI-4.1)
	id AA13860; Sun, 21 Mar 93 19:40:33 EST
From: fredh@cs.clemson.edu
Message-Id: <9303220040.AA13860@cs.clemson.edu>
Subject: Colloquium Notice
To: all_users
Date: Sun, 21 Mar 93 19:40:30 EST
X-Mailer: ELM [version 2.3 PL11]
Status: OR

Colloquium Notice:

        Daniel Hall Room 303, Monday March 22, 1993 at 2:30pm

                      DISSERTATION PROPOSAL
                       Parallel Algorithms
                      for the Calculation of
                Steiner Minimal Trees in the Plane

                     Frederick C. Harris, Jr.

                           ABSTRACT

The Steiner Problem is simply stated as follows:  Given a set of points
V={1,2,...,n} in the plane, construct a tree T, which contains V as a
subset of the vertices such that T has minimum length.  This tree, T,
is called the Steiner Minimal Tree.

This dissertation proposal will present the problem, its history, and
research proposals to develop parallel algorithms to calculate Steiner
Minimal Trees.

Committee: S.T. Hedetniemi(chair), R.C. Laskar, B.A. Malloy, R.P. Pargas