Back to search

University of British Columbia

On the steiner problem

Abstract

dc:description

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 rather than points in E² and also by minimising a more general graph function than length, thus yielding a large class of network minimisation problems which have a wide variety of practical applications, The thesis is concerned with the following aspects of these problems. 1. Existence and uniqueness or multiplicity of solutions. 2. The structure of solutions and demonstration that minimising trees of various problems share common properties. 3. Solvability of problems by Euclidean constructions or by other geometrical methods.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy - PhD
Level thesis:degree_level
doctoral
Discipline thesis:degree_discipline
Mathematics
Grantor dc:publisher
University of British Columbia
Year dc:date
1967

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Cockayne, Ernest

Rights

dc:rights
Statement dc:rights
  • For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.
Language dc:language
eng

Identifiers

dc:identifier.*
Handle dc:identifier
http://hdl.handle.net/2429/41202

Chain of custody

source
Harvested from
University of British Columbia
Base URL
circle.library.ubc.ca/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Cockayne, Ernest. On the steiner problem. doctoral thesis, University of British Columbia, 1967. http://hdl.handle.net/2429/41202