Steiner Trees in Industries: 11 - Rilegato

 
9781402000997: Steiner Trees in Industries: 11
Rilegato
ISBN 10: 1402000995 ISBN 13: 9781402000997
Casa editrice: Kluwer Academic Pub, 2001

Sinossi

This book is a collection of articles studying various Steiner tree prob­ lems with applications in industries, such as the design of electronic cir­ cuits, computer networking, telecommunication, and perfect phylogeny. The Steiner tree problem was initiated in the Euclidean plane. Given a set of points in the Euclidean plane, the shortest network interconnect­ ing the points in the set is called the Steiner minimum tree. The Steiner minimum tree may contain some vertices which are not the given points. Those vertices are called Steiner points while the given points are called terminals. The shortest network for three terminals was first studied by Fermat (1601-1665). Fermat proposed the problem of finding a point to minimize the total distance from it to three terminals in the Euclidean plane. The direct generalization is to find a point to minimize the total distance from it to n terminals, which is still called the Fermat problem today. The Steiner minimum tree problem is an indirect generalization. Schreiber in 1986 found that this generalization (i.e., the Steiner mini­ mum tree) was first proposed by Gauss.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Contenuti

Foreword. Steiner Minimum Trees in Uniform Orientation Metrics; M. Brazil. Genetic Algorithm Approaches to Solve Various Steiner Tree Problems; G. Chakraborty. Neural Network Approaches to Solve Various Steiner Tree Problems; G. Chakraborty. Steiner Tree Problems in VLSI Layout Designs; Jung-Dong Cho. Polyhedral Approaches for the Steiner Tree Problem on Graphs; S. Chopra, Chih-Yang Tsai. The Perfect Phylogeny Problem; D. Fernández-Baca. Approximation Algorithms for the Steiner Tree Problems in Graphs; C. Gröpl, et al. A Proposed Experiment on Soap Film Solutions of Planar Euclidean Steiner Trees; F.K. Hwang. SteinLib: An Updated Library on Steiner Tree Problems in Graphs; T. Koch, et al. Steiner Tree Based Distributed Multicast Routing in Networks; R. Novak, et al. On Cost Allocation in Steiner Tree Networks; D. Skorin-Kapov. Steiner Trees and the Dynamic Quadratic Assignment Problem; J.M. Smith. Polynomial Time Algorithms for the Rectilinear Steiner Tree Problem; D.A. Thomas, Jai F. Weng. Minimum Networks for Separating and Surrounding Objects; Jai F. Weng. A First Level Scatter Search Implementation for Solving the Steiner Ring Problem in Telecommunications Network Design; Jiefeng Xu, et al. The Rectilinear Steiner Tree Problem: A Tutorial; M. Zachariasen.

Product Description

Book by None

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
Kluwer Academic Pub
Data di pubblicazione
2001
Lingua
Inglese
ISBN 10 
1402000995
ISBN 13 
9781402000997
Rilegatura
Copertina rigida
Numero di pagine
507
Redattore
Cheng Xiuzhen, Du Ding-Zhu
Contatto del produttore
non disponibile
Persona responsabile
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Germania