\begin{thebibliography}{10}

\bibitem{jk34:omgodb}
V.~{Jarn\'{i}k} and O.~{K\"{o}ssler}.
\newblock O minim\'{a}lnich gratech obsahujicich n dan\'{y}ch bodu [in
  {C}zech].
\newblock {\em Casopis Pesk. Mat. Fyr.}, 63:223--235, 1934.

\bibitem{cr41:wim}
R.~Courant and H.~Robbins.
\newblock {\em What is Mathematics? an elementary approach to ideas and
  methods}.
\newblock Oxford University Press, London, 1941.

\bibitem{bg89:tsnp}
M.W. Bern and R.L. Graham.
\newblock The shortest-network problem.
\newblock {\em Sci. Am.}, 260(1):84--89, January 1989.

\bibitem{hr92:survey}
F.K. Hwang and D.S. Richards.
\newblock Steiner tree problems.
\newblock {\em Networks}, 22(1):55--89, January 1992.

\bibitem{hrw:annals}
F.K. Hwang, D.S. Richards, and P.~Winter.
\newblock {\em The Steiner Tree Problem}, volume~53 of {\em Ann. Discrete
  Math.}
\newblock North-Holland, Amsterdam, 1992.

\bibitem{gp68:smt}
E.N. Gilbert and H.O. Pollak.
\newblock Steiner minimal trees.
\newblock {\em SIAM J. Appl. Math.}, 16(1):1--29, January 1968.

\bibitem{dh92:apotgpcotsr}
D.Z. Du and F.H. Hwang.
\newblock A proof of the {G}ilbert-{P}ollak conjecture on the {S}teiner ratio.
\newblock {\em Algorithmica}, 7(2/3):121--135, 1992.

\bibitem{melzak61:otpos}
Z.A. Melzak.
\newblock On the problem of {S}teiner.
\newblock {\em Canad. Math. Bull.}, 4(2):143--150, 1961.

\bibitem{ggj77:tcocsmt}
M.R. Garey, R.L. Graham, and D.S Johnson.
\newblock The complexity of computing {S}teiner minimal trees.
\newblock {\em SIAM J. Appl. Math.}, 32(4):835--859, June 1977.

\bibitem{cockayne67:otsp}
E.J. Cockayne.
\newblock On the {S}teiner problem.
\newblock {\em Canad. Math. Bull.}, 10(3):431--450, 1967.

\bibitem{cs72:cosmt}
E.J. Cockayne and D.G. Schiller.
\newblock Computation of {S}teiner minimal trees.
\newblock In D.J.A. Welsh and D.R. Woodall, editors, {\em Combinatorics}, pages
  52--71, Maitland House, Warrior Square, Southend-on-Sea, Essex SS1 2J4, 1972.
  Mathematical Institute, Oxford, Inst. Math. Appl.

\bibitem{peter:pntmos}
J.L. Peterson.
\newblock {\em Petri Net Theory and the Modeling of Systems}.
\newblock Prentice-Hall, Englewood Cliffs, NJ, 1981.

\bibitem{moll82:pauspn}
Michael~K. Molloy.
\newblock Performance analysis using stochastic {P}etri nets.
\newblock {\em IEEE Trans. Comput.}, C-31(9):913--917, September 1982.

\bibitem{gross:nnnpma}
S.~Grossberg.
\newblock Nonlinear neural networks: Principles, mechanisms, and architectures.
\newblock {\em Neural Networks}, {1}:17--61, 1988.

\bibitem{hopfi:ngrhccplttsn}
J.J. Hopfield.
\newblock Neurons with graded response have collective computational properties
  like those of two-state neurons.
\newblock {\em Proc. Nat. Acad. Sci.}, {81}:3088--3092, 1984.

\bibitem{geist:acm92}
R.~Geist, D.~Suggs, R.~Reynolds, S.~Divatia, F.~Harris, E.~Foster, and
  P.~Kolte.
\newblock Disk performance enhancement through {M}arkov-based cylinder
  remapping.
\newblock In Cherri~M. Pancake and Douglas~S. Reeves, editors, {\em Proc. of
  the ACM Southeastern Regional Conf.}, pages 23--28, Raleigh, North Carolina,
  April 1992. The Association for Computing Machinery, Inc.

\bibitem{geist:mmsdmdscr}
R.~Geist, D.~Suggs, and R.~Reynolds.
\newblock Minimizing mean seek distance in mirrored disk systems by cylinder
  remapping.
\newblock In {\em Proc. $16^{th}$ IFIP Int. Symp. on Computer Performance
  Modeling, Measurement, and Evaluation (PERFORMANCE `93)}, pages 91--108,
  Rome, Italy, September 1993.

\bibitem{geist:nnddftce}
R.~Geist and D.~Suggs.
\newblock Neural networks for the design of distributed, fault-tolerant,
  computing environments.
\newblock In {\em Proc. $11^{th}$ IEEE Symp. on Reliable Distributed Systems
  (SRDS)}, pages 189--195, Houston, Texas, October 1992.

\bibitem{geist:amfdh}
R.~Geist, R.~Reynolds, and D.~Suggs.
\newblock A markovian framework for digital halftoning.
\newblock {\em ACM Trans. Graphics}, {12}(2):136--159, April 1993.

\bibitem{geist:cscq}
R.~Geist, R.~Reynolds, and C.~Dove.
\newblock Context sensitive color quantization.
\newblock Technical Report 91--120, Dept. of Comp. Sci., Clemson Univ.,
  Clemson, SC 29634, July 1991.

\bibitem{reynolds:dissertation}
W.R. Reynolds.
\newblock {\em A Markov Random Field Approach to Large Combinatorial
  Optimization Problems}.
\newblock PhD thesis, Clemson, University, Clemson, SC 29634, August 1993.

\bibitem{kirkp:osa}
S.~Kirkpatrick, C.~Gelatt, and M.~Vecchi.
\newblock Optimization by simulated annealing.
\newblock {\em Science}, {220}(13):671--680, May 1983.

\bibitem{papa}
G.~Georgakopoulos and C.~Papadimitriou.
\newblock A 1-steiner tree problem.
\newblock {\em J. Algorithms}, 8(1):122--130, Mar 1987.

\bibitem{shamos}
F.P. Preparata and M.I. Shamos.
\newblock {\em Computational Geometry: an introduction}.
\newblock Springer-Verlag, New York, NY, 1988.

\bibitem{ch92:icopsmt}
E.J. Cockayne and D.E. Hewgill.
\newblock Improved computation of plane {S}teiner minimal trees.
\newblock {\em Algorithmica}, 7(2/3):219--229, 1992.

\bibitem{shamos:phd}
M.I. Shamos.
\newblock {\em Computational Geometry}.
\newblock PhD thesis, Department of Computer Science, Yale University, New
  Haven, CT, 1978.

\bibitem{chow:phd}
A.~Chow.
\newblock {\em Parallel Algorithms for Geometric Problems}.
\newblock PhD thesis, University of Illinois, Urbana-Champaign, IL, 1980.

\bibitem{acgoy88:pcg}
A.~Aggarwal, B.~Chazelle, L.~Guibas, C.~O'Dunlaing, and C.~Yap.
\newblock Parallel computational geometry.
\newblock {\em Algorithmica}, 3(3):293--327, 1988.

\bibitem{ag88:pafsfotcp}
M.J. Atallah and M.T. Goodrich.
\newblock Parallel algorithms for some functions of two convex polygons.
\newblock {\em Algorithmica}, {3}(4):535--548, 1988.

\bibitem{cockayne70:oteotafsmt}
E.J. Cockayne.
\newblock On the efficiency of the algorithm for {S}teiner minimal trees.
\newblock {\em SIAM J. Appl. Math.}, 18(1):150--159, January 1970.

\bibitem{hstd88:adtoesmt}
F.K. Hwang, G.D. Song, G.Y. Ting, and D.Z. Du.
\newblock A decomposition theorem on {E}uclidian {S}teiner minimal trees.
\newblock {\em Disc. Comput. Geom.}, 3(4):367--382, 1988.

\bibitem{jaja:book}
J.~J\'aJ\'a.
\newblock {\em An Introduction to Parallel Algorithms}.
\newblock Addison-Wesley Publishing Company, Reading, MA, 1992.

\bibitem{kggk:book}
V.~Kumar, A.~Grama, A.~Gupta, and Karypis G.
\newblock {\em Introduction to Parallel Computing: Design and Analysis of
  Algorithms}.
\newblock The Benjamin/Cummings Publishing Company, Inc., Redwood City, CA,
  1994.

\bibitem{smith:book}
J.R. Smith.
\newblock {\em The Design and Analysis of Parallel Algorithms}.
\newblock Oxford University Press, Inc., New York, NY, 1993.

\bibitem{bs75:aivocspsftmnp}
W.M. Boyce and J.R. Seery.
\newblock {STEINER} 72 -- an improved version of {C}ockayne and {S}chiller's
  program {STEINER} for the minimal network problem.
\newblock Technical Report~35, Bell Labs., Dept. of Computer Science, 1975.

\bibitem{winter85:aaftspitep}
P.~Winter.
\newblock An algorithm for the {S}teiner problem in the {E}uclidian plane.
\newblock {\em Networks}, 15(3):323--345, Fall 1985.

\bibitem{qd85:ubspbbbba}
M.J. Quinn and N.~Deo.
\newblock An upper bound for the speedup of parallel best-bound
  branch-and-bound algorithms.
\newblock {\em BIT}, 26(1):35--43, 1986.

\bibitem{ch86:ecosmtitp}
E.J. Cockayne and D.E. Hewgill.
\newblock Exact computation of {S}teiner minimal trees in the plane.
\newblock {\em Info. Proccess. Lett.}, 22(3):151--156, March 1986.

\bibitem{cg:stfl}
F.R.K. Chung and R.L. Graham.
\newblock Steiner trees for ladders.
\newblock In B.~Alspach, P.~Hell, and D.J. Miller, editors, {\em Annals of
  Discrete Mathematics:2}, pages 173--200. North--Holland Publishing Company,
  1978.

\bibitem{cgg:stoac}
F.R.K. Chung, M.~Gardner, and R.L. Graham.
\newblock Steiner trees on a checkerboard.
\newblock {\em Math. Mag.}, 62:83--96, 1989.

\bibitem{hedet}
S.~Hedetniemi.
\newblock Characterizations and constructions of minimally 2-connected graphs
  and minimally strong digraphs.
\newblock In {\em Proc. $2^{nd}$ Louisiana Conf. on Combinatorics, Graph
  Theory, and Computing}, pages 257--282, Louisiana State Univ., Baton Rouge,
  Louisiana, March 1971.

\end{thebibliography}
