附註:Includes bibliographical references (pages 231-262) and index.
Preface -- Two Classical Optimization Problems -- Gauss' Question -- What does Solution Mean -- Network Design Problems -- A New Challenge: The Phylogeny -- An Analysis of Steiner's Problem in Phylogenetic Spaces -- Tree Building Algorithms -- References -- Index.
摘要:"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."--Jacket.
