Shortest Connectivity : An Introduction with Applications in Phylogeny

The problem of "Shortest Connectivity" has a long and convoluted history: given a finite set of points in a metric space, search for a network that connects these points with the shortest possible length. This shortest network must be a tree and may contain vertices different from the poin...

Celý popis

Uloženo v:
Podrobná bibliografie
Hlavní autor: Cieslik, Dietmar
Médium: Livre numérique
Jazyk:Anglais
Vydáno: New York, NY : Springer US 2005.
Cham : Springer Nature
Edice:Combinatorial Optimization 17
On-line přístup:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Poznámka: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Shortest Connectivity, Texte imprimé, 9780387503431
• Shortest Connectivity, Texte imprimé, 9781461498537
• Shortest Connectivity, Texte imprimé, 9780387235387
LEADER 03392nam a22003377a 4500
001 1403624
008 080409s2005 xx ||| |||| 00| 0 eng d
009 PPN123070686
020 |a 9780387235394 
041 0 |a eng 
082 |a 519.6 
100 1 |a Cieslik, Dietmar. 
245 1 0 |a Shortest Connectivity :  |b An Introduction with Applications in Phylogeny   |c by Dietmar Cieslik. 
260 |a New York, NY :  |b Springer US. 
260 |a Cham :  |b Springer Nature,  |c 2005. 
490 0 |a Combinatorial Optimization  |v 17 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a 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. 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
520 |a The problem of "Shortest Connectivity" has a long and convoluted history: given a finite set of points in a metric space, search for a network that connects these points with the shortest possible length. This shortest network must be a tree and may contain vertices different from the points which are to be connected. Over the years more and more real-life problems are given, which use this problem or one of its relatives as an application, as a subproblem or a model. 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. . 
776 0 |t Shortest Connectivity  |b Texte imprimé  |z 9780387503431 
776 0 |t Shortest Connectivity  |b Texte imprimé  |z 9781461498537 
776 0 |t Shortest Connectivity  |b Texte imprimé  |z 9780387235387 
856 4 |u https://doi.org/10.1007/b101778  |z Accès sur la plateforme de l'éditeur 
856 4 |q PDF  |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-63PGW497-M  |z Accès sur la plateforme Istex 
856 4 |5 452349901:876782489  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/b101778  |z Accès Université d'Orléans 
856 4 |5 180339901:876785801  |u uhttps://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/b101778  |z Accès INSA CVL 
997 |0 1403624  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/