000 03185nam a22004695i 4500
001 978-0-387-23539-4
003 DE-He213
005 20250710083929.0
007 cr nn 008mamaa
008 100301s2005 xxu| s |||| 0|eng d
020 _a9780387235394
_a99780387235394
024 7 _a10.1007/b101778
_2doi
082 0 4 _a519.6
_223
100 1 _aCieslik, Dietmar.
_eauthor.
245 1 0 _aShortest Connectivity
_h[recurso electrónico] :
_bAn Introduction with Applications in Phylogeny /
_cby Dietmar Cieslik.
264 1 _aBoston, MA :
_bSpringer US,
_c2005.
300 _aX, 268 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aCombinatorial Optimization,
_x1388-3011 ;
_v17
505 0 _aTwo 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.
520 _aThe 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.
650 0 _aMATHEMATICS.
650 0 _aBIOLOGY
_xMATHEMATICS.
650 0 _aMATHEMATICAL OPTIMIZATION.
650 0 _aOPERATIONS RESEARCH.
650 1 4 _aMATHEMATICS.
650 2 4 _aOPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING.
650 2 4 _aOPTIMIZATION.
650 2 4 _aMATHEMATICAL MODELING AND INDUSTRIAL MATHEMATICS.
650 2 4 _aMATHEMATICAL BIOLOGY IN GENERAL.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9780387235387
830 0 _aCombinatorial Optimization,
_x1388-3011 ;
_v17
856 4 0 _uhttp://dx.doi.org/10.1007/b101778
_zVer el texto completo en las instalaciones del CICY
912 _aZDB-2-SMA
942 _2ddc
_cER
999 _c56223
_d56223