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,332
Discovery Miles 43 320
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,332 Discovery Miles 43 320 | Repayment Terms: R406 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
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,056 Discovery Miles 50 560
Handbook of Research on Advanced…
Madhumangal Pal, Sovan Samanta, … Hardcover R7,051 Discovery Miles 70 510
Code Based Secret Sharing Schemes…
Patrick Sole, Selda Calkavur, … Hardcover R2,261 Discovery Miles 22 610
Probability - Risk Management…
Daniel Covington Hardcover R915 Discovery Miles 9 150
Mesh - Eine Reise Durch Die Diskrete…
Beau Janzen, Konrad Polthier Book R171 Discovery Miles 1 710
Social Simulation for a Crisis - Results…
Frank Dignum Hardcover R4,608 Discovery Miles 46 080
Boolean Structures: Combinatorics…
Gennaro Auletta Hardcover R2,985 Discovery Miles 29 850
Research Trends in Graph Theory and…
Daniela Ferrero, Leslie Hogben, … Hardcover R3,259 Discovery Miles 32 590
Essential Topics in Combinatorics
Lucas Lincoln Hardcover R2,919 Discovery Miles 29 190
Magic Graphs
Alison M. Marr, W.D. Wallis Hardcover R2,019 R1,830 Discovery Miles 18 300
Galois Covers, Grothendieck-Teichmuller…
Frank Neumann, Sibylle Schroll Hardcover R4,264 Discovery Miles 42 640
Algebraic Number Theory and Fermat's…
Ian Stewart, David Tall Paperback R1,230 Discovery Miles 12 300

See more

Partners