On the steiner problem
The classical Steiner Problem may be stated: Given n points [formula omitted] in the Euclidean plane, to construct the shortest tree(s) (i.e. undirected, connected, circuit free graph(s)) whose vertices include [formula omitted]. The problem is generalised by considering sets in a metric space...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
University of British Columbia
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2429/41202 |