Networks, Spaces and Algorithms
The main subject of this book is the Steiner ratio in metric spaces. We will use many basic definitions and facts related to the theory of metric spaces. Moreover, we have to consider networks as the solutions of Steiner’s Problem. Finally, we are interested in algorithmic methods to determine shortest trees. Hence, we have to discuss the terminology of algorithms. Most of the definitions about networks, spaces and algorithms are quoted in this chapter. All proofs are omitted.
KeywordsSpan Tree Unit Ball Connected Graph Minimum Span Tree Steiner Point
Unable to display preview. Download preview PDF.