0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Combinatorics & graph theory

Buy Now

Steiner Minimal Trees (Hardcover, 1998 ed.) Loot Price: R4,541
Discovery Miles 45 410
Steiner Minimal Trees (Hardcover, 1998 ed.): Dietmar Cieslik

Steiner Minimal Trees (Hardcover, 1998 ed.)

Dietmar Cieslik

Series: Nonconvex Optimization and Its Applications, 23

 (sign in to rate)
Loot Price R4,541 Discovery Miles 45 410 | Repayment Terms: R426 pm x 12*

Bookmark and Share

Expected to ship within 12 - 17 working days

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 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 is called a Steiner Minimal Tree (SMT). It may contain vertices different from the points which are to be connected. Such points are called Steiner points. Steiner's Problem seems disarmingly simple, but it is rich with possibilities and difficulties, even in the simplest case, the Euclidean plane. This is one of the reasons that an enormous volume of literature has been published, starting in 1 the seventeenth century and continuing until today. The difficulty is that we look for the shortest network overall. Minimum span ning networks have been well-studied and solved eompletely in the case where only the given points must be connected. The novelty of Steiner's Problem is that new points, the Steiner points, may be introduced so that an intercon necting network of all these points will be shorter. This also shows that it is impossible to solve the problem with combinatorial and geometric methods alone."

General

Imprint: Springer
Country of origin: Netherlands
Series: Nonconvex Optimization and Its Applications, 23
Release date: March 1998
First published: March 1998
Authors: Dietmar Cieslik
Dimensions: 234 x 156 x 20mm (L x W x T)
Format: Hardcover
Pages: 322
Edition: 1998 ed.
ISBN-13: 978-0-7923-4983-9
Categories: Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
Promotions
LSN: 0-7923-4983-0
Barcode: 9780792349839

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Applied Combinatorics
Alan Tucker Hardcover R5,304 Discovery Miles 53 040
Handbook of Research on Advanced…
Madhumangal Pal, Sovan Samanta, … Hardcover R7,398 Discovery Miles 73 980
Forbidden Configurations in Discrete…
David Eppstein Hardcover R2,794 Discovery Miles 27 940
Code Based Secret Sharing Schemes…
Patrick Sole, Selda Calkavur, … Hardcover R2,372 Discovery Miles 23 720
Fixed Point Theory and Graph Theory…
Monther Alfuraidan, Qamrul Ansari Hardcover R2,030 R1,915 Discovery Miles 19 150
The Math Behind the Magic - Fascinating…
Ehrhard Behrends Paperback R931 Discovery Miles 9 310
Probability - Risk Management…
Daniel Covington Hardcover R956 Discovery Miles 9 560
Bent Functions - Results and…
Natalia Tokareva Paperback R1,498 Discovery Miles 14 980
Mesh - Eine Reise Durch Die Diskrete…
Beau Janzen, Konrad Polthier Book R179 Discovery Miles 1 790
Spectral Radius of Graphs
Dragan Stevanovic Paperback R976 Discovery Miles 9 760
Social Simulation for a Crisis - Results…
Frank Dignum Hardcover R4,833 Discovery Miles 48 330
Boolean Structures: Combinatorics…
Gennaro Auletta Hardcover R3,134 Discovery Miles 31 340

See more

Partners