Dietmar Cieslik – författare
Visar alla böcker från författaren Dietmar Cieslik. Handla med fri frakt och snabb leverans.
9 produkter
Shortest Connectivity
An Introduction with Applications in Phylogeny
Inbunden, 2004
1098 kr
Lägg i varukorg
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.
Shortest Connectivity
An Introduction with Applications in Phylogeny
E-bok, 2006
1459 kr
Lägg i varukorg
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.
Steiner Minimal Trees
Inbunden, 1998
1643 kr
Lägg i varukorg
The problem of "Shortest Connectivity", which is discussed here, has a long and convoluted history. Many scientists from many fields as well as laymen have stepped on its stage. Usually, the problem is known as Steiner's Problem and it can be described more precisely in the following way: Given a …
Steiner Ratio
Inbunden, 2001
1098 kr
Lägg i varukorg
Steiner's Problem concerns finding a shortest interconnecting network for a finite set of points in a metric space. A solution must be a tree, which is called a Steiner Minimal Tree (SMT), and may contain vertices different from the points which are to be connected. Steiner's Problem is one of the …
Steiner Minimal Trees
Häftad, 2010
1643 kr
Lägg i varukorg
The problem of "Shortest Connectivity", which is discussed here, has a long and convoluted history. Many scientists from many fields as well as laymen have stepped on its stage. Usually, the problem is known as Steiner's Problem and it can be described more precisely in the following way: Given a …
Steiner Ratio
Häftad, 2010
1098 kr
Lägg i varukorg
Steiner's Problem concerns finding a shortest interconnecting network for a finite set of points in a metric space. A solution must be a tree, which is called a Steiner Minimal Tree (SMT), and may contain vertices different from the points which are to be connected. Steiner's Problem is one of the …
Shortest Connectivity
An Introduction with Applications in Phylogeny
Häftad, 2014
1316 kr
Lägg i varukorg
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.
Steiner Minimal Trees
E-bok, 2013
2111 kr
Lägg i varukorg
The problem of "Shortest Connectivity", which is discussed here, has a long and convoluted history. Many scientists from many fields as well as laymen have stepped on its stage. Usually, the problem is known as Steiner''s Problem and it can be described more precisely in the following way: Given a …
Steiner Ratio
E-bok, 2013
1459 kr
Lägg i varukorg
Steiner''s Problem concerns finding a shortest interconnecting network for a finite set of points in a metric space. A solution must be a tree, which is called a Steiner Minimal Tree (SMT), and may contain vertices different from the points which are to be connected. Steiner''s Problem is one of …
