\begin{itemize}
	\item Question: Would a neural algorithm be a good
	approximation algorithm for the Steiner Minimal Tree problem?
	Why?

	\item Answer:  Design of Neural Algorithms is probably one of
	my weakest areas of code design.  I guess it probably comes
	from the fact that I have never done any implementation of a
	neural net (It is probably because they are typically huge
	(memory hogs) and slow (could just be the machines I have seen
	them run on) for most non-trivial problems -- but they do come
	up with answers).

	However, due to the fact that there are already very fast
	approximation algorithms (Linear if I remember correctly) for
	the Steiner Minimal Tree problem, a neural net probably would
	just be a member of the pack along with a lot of others that
	could be implemented.

\end{itemize}
