\documentstyle[12pt]{article}
\pagestyle{empty}
\textwidth=6.5in
\textheight=9in
\evensidemargin=0in
\oddsidemargin=0in
\topmargin=-0.3in
\topskip=0pt
\baselineskip=12pt
\parskip=0pt 
\parindent=0em
\begin{document}
\huge
\begin{center}
{\bf COLLOQUIUM NOTICE:}
\end{center}
\hspace{1in}
\Large
\begin{center}
{\bf DISSERTATION PROPOSAL}\\
\large
\hspace{1in}\\
Parallel Algorithms\\
for the Calculation of\\
Steiner Minimal Trees in the Plane\\
\hspace{1in}\\
Frederick C. Harris, Jr.\\

\hspace{1in}\\
Monday March 22, 1993 at 2:30pm\\
Room 303, Daniel Hall\\
\hspace{1in}\\
\hspace{1in}\\

{\bf ABSTRACT}
\end{center}
\normalsize
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.

\hspace{1in}

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

\hspace{1in}

{\bf Committee:} S.T. Hedetniemi(chair), R.C. Laskar, B.A. Malloy, R.P. Pargas
\end{document}
