Drexel dragonThe Math ForumDonate to the Math Forum

The Math Forum Internet Mathematics Library

The Steiner Tree Page

_____________________________________
Library Home || Full Table of Contents || Suggest a Link || Library Help
_____________________________________

Visit this site: http://ganley.org/steiner/
Author:Joe Ganley
Description: The Steiner tree problem is a minimum interconnection problem. The most basic version is in a graph: given a weighted graph in which a subset of vertices are identified as terminals, find a minimum-weight connected subgraph that includes all the terminals. If the edge weights are all positive, then the resulting subgraph is obviously a tree. The problem can also be applied in the geometric realm; the two most common variants are the Euclidean Steiner tree and rectilinear Steiner tree problems. People, open problems, and a bibliography.
Levels: College, Research
Languages: English
Resource Types: Problems/Puzzles, Books, Bibliographies
Math Topics: Graph Theory

[Privacy Policy] [Terms of Use]

_____________________________________
Home || The Math Library || Quick Reference || Search || Help
_____________________________________

© 1994-2013 Drexel University. All rights reserved.
http://mathforum.org/
 The Math Forum is a research and educational enterprise of the Goodwin College of Professional Studies.The Math Forum is a research and educational enterprise of the Drexel University School of Education.