0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Geometry > Algebraic geometry

Buy Now

Steiner Minimal Trees (Paperback, Softcover reprint of hardcover 1st ed. 1998) Loot Price: R4,362
Discovery Miles 43 620
Steiner Minimal Trees (Paperback, Softcover reprint of hardcover 1st ed. 1998): Dietmar Cieslik

Steiner Minimal Trees (Paperback, Softcover reprint of hardcover 1st ed. 1998)

Dietmar Cieslik

Series: Nonconvex Optimization and Its Applications, 23

 (sign in to rate)
Loot Price R4,362 Discovery Miles 43 620 | Repayment Terms: R409 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 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-Verlag New York
Country of origin: United States
Series: Nonconvex Optimization and Its Applications, 23
Release date: December 2010
First published: 1998
Authors: Dietmar Cieslik
Dimensions: 235 x 155 x 17mm (L x W x T)
Format: Paperback
Pages: 322
Edition: Softcover reprint of hardcover 1st ed. 1998
ISBN-13: 978-1-4419-4790-1
Categories: Books > Science & Mathematics > Mathematics > Geometry > Algebraic geometry
Books > Science & Mathematics > Mathematics > Optimization > General
Promotions
LSN: 1-4419-4790-6
Barcode: 9781441947901

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..

Sasakian Geometry
Charles Boyer, the late Krzysztof Galicki Hardcover R5,349 Discovery Miles 53 490
Michael Atiyah Collected Works - Volume…
Michael Atiyah Hardcover R9,656 Discovery Miles 96 560
Cyclic Modules and the Structure of…
S.K. Jain, Ashish K. Srivastava, … Hardcover R5,490 Discovery Miles 54 900
Riemann Surfaces
Simon Donaldson Hardcover R4,199 Discovery Miles 41 990
Sets, Groups, and Mappings - An…
Andrew D. Hwang Hardcover R2,330 Discovery Miles 23 300
Deformation Theory of Discontinuous…
Ali Baklouti Hardcover R5,537 Discovery Miles 55 370
The Classification of the Finite Simple…
Inna Capdeboscq, Daniel Gorenstein, … Paperback R2,558 Discovery Miles 25 580
One-cocycles And Knot Invariants
Thomas Fiedler Hardcover R3,326 Discovery Miles 33 260
Algebras, Lattices, Varieties - Volume…
Ralph S Freese, Ralph N. McKenzie, … Paperback R3,219 Discovery Miles 32 190
Infinity Operads And Monoidal Categories…
Donald Yau Hardcover R4,094 Discovery Miles 40 940
Geometric Sculptures - an Exploration of…
Rocky Lau Hardcover R1,776 Discovery Miles 17 760
Associative Algebraic Geometry
Arvid Siqveland Hardcover R3,822 Discovery Miles 38 220

See more

Partners