Encyclopedia of Operations Research and Management Science

2001 Edition
| Editors: Saul I. Gass, Carl M. Harris

Steiner tree problem

Reference work entry
DOI: https://doi.org/10.1007/1-4020-0611-X_999

For a network with N nodes, we are given a subset S of its nodes. The problem is to determine a minimum length (cost) tree that contains all the nodes of S and, optionally, some other nodes from the set N. The Steiner tree problem is often defined on the Euclidean plane where the problem is to find the minimum length (distance) tree that spans a given set of S nodes. Here, the tree can contain nodes (points) other than those in S. Minimum spanning tree.

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  1. 1.Robert H. Smith School of BusinessUniversity of MarylandCollege PartUSA
  2. 2.School of Information Technology & EngineeringGeorge Mason UniversityFairfaxUSA