LIBERO WebOPAC Catalogue Display (W561)

Catalogue Information
Field name	Details
Dewey Class	004.0151
Title	Steiner Minimal Trees ([EBook] /) / by Dietmar Cieslik.
Author	Cieslik, Dietmar
Other name(s)	SpringerLink (Online service)
Publication	Boston, MA : : Springer US : : Imprint: Springer, , 1998.
Physical Details	XII, 322 p. : online resource.
Series	Nonconvex Optimization and Its Applications 1571-568X ; ; 23
ISBN	9781475765854
Summary Note	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.:
Contents note	1 Introduction -- 2 SMT and MST in Metric Spaces — A Survey -- 3 Fermat’s Problem in Banach-Minkowski Spaces -- 4 The Degrees of the Vertices in Shortest Trees -- 5 1-Steiner-Minimal-Trees -- 6 Methods to Construct Shortest Trees -- 7 The Steiner Ratio of Banach-Minkowski Spaces -- 8 Generalizations -- References.
System details note	Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site	http://dx.doi.org/10.1007/978-1-4757-6585-4
Links to Related Works	Subject References: Computer Science . Convex and Discrete Geometry . Convex geometry . Discrete geometry . Discrete Mathematics in Computer Science . Mathematical optimization . Optimization . Authors: Cieslik, Dietmar . Corporate Authors: SpringerLink (Online service) . Series: Nonconvex Optimization and Its Applications . Classification: 004.0151 .

Catalogue Display

Steiner Minimal Trees

Reviews