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...
Сохранить в:
| Главный автор: | |
|---|---|
| Формат: | Livre numérique |
| Язык: | Anglais |
| Опубликовано: |
New York, NY :
Springer US
2005.
Cham : Springer Nature |
| Серии: | Combinatorial Optimization
17 |
| Online-ссылка: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Примечание: |
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 |
Оглавление:
- 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.