

\documentclass[11pt,fleqn]{article}
\usepackage{fig/psfig}
\usepackage{fig/fullpage}
\usepackage{bbm}
\usepackage{amsmath,amssymb,amsthm}

\newcommand{\wi}{\widehat{i}}

\newcommand{\D}{\mathcal D} 


\begin{document}

\input{lib_commands.tex}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

Recall that I came up with an MstT algorithm for the Adaptive Stack
model. I was also excited that it was a faster algorithm.
But then it was found  that Kou, Markowsky and Berman \cite{KMB} had
an equally fast algorithm. At this point, I change the write up of my
algorithm. At his time, I had a list of questions.
We also need to get the bibliography together better. James perhaps
you could now think about these? 

I couldn't find an easy way to copy their bibliography from their .pdf
file. James, perhaps you can figure it out or type them out.
Perhaps we should add the following.

\bi
\i Steiner trees were first considered by Gilbert and Pollak [3].
\i NP-complete [2]
\i Takahashi and Matsuyama [6] and Kou, Markowsky and Berman [4] give
2-approximations. The algorithm from \rtm{tm
  MST} is referenced to [4]. [6] is older. I am not sure how it is
different.
\i Papers [8] and [7] give earlier versions of this paper, so I group them
all together.
\i I believe our implementation is more elegant.
\ei


\end{document}




