Shortest Connectivity: An Introduction with Applications in Phylogeny

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

"This volume is an introduction to the theory of shortest connectivity, as the core of the so-called "Geometric Network Design Problems", where the general problem can be stated as follows: given a configuration of vertices and/or edges, find a network which contains these objects, satisfies some predetermined requirements, and which minimizes a given objective function that depends on several distance measures. A new application of shortest connectivity is also discussed, namely to create trees which reflect the evolutionary history of "living entities". The aim in this graduate level text is to outline the key mathematical concepts that underpin these important questions in applied mathematics. These concepts involve discrete mathematics (particularly graph theory), optimization, computer science, and several ideas in biology.

Author(s): Dietmar Cieslik
Series: Combinatorial Optimization
Edition: 1
Publisher: Springer
Year: 2004

Language: English
Pages: 276

front-matter......Page 1
1Two Classical Optimization Problems......Page 10
2Gauss’ Question......Page 30
3What Does Solution Mean......Page 64
4Network Design Problems......Page 92
5A New Challenge The Phylogeny......Page 132
6An Analysis of Steiner’s Problem in Phylogenetic Spaces......Page 180
7Tree Building Algorithms......Page 218
back-matter......Page 239