Logo - springer
Slogan - springer

Mathematics - Applications | Shortest Connectivity - An Introduction with Applications in Phylogeny

Shortest Connectivity

An Introduction with Applications in Phylogeny

Series: Combinatorial Optimization, Vol. 17

Cieslik, Dietmar

2005, IX, 268 p.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$129.00

(net) price for USA

ISBN 978-0-387-23539-4

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$169.00

(net) price for USA

ISBN 978-0-387-23538-7

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$169.00

(net) price for USA

ISBN 978-1-4614-9853-7

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

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.

 

Content Level » Research

Keywords » algorithms - biology - mathematics - optimization - phylogeny

Related subjects » Applications - Mathematics

Table of contents / Sample pages 

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.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Operations Research, Mathematical Programming.