The Steiner Ratio
The Steiner Ratio

Author: Dietmar Cieslik

Publisher: Springer Science & Business Media

Published: 2013-03-14

Total Pages: 247

ISBN-13: 1475767986

DOWNLOAD EBOOK

Steiner's Problem concerns finding a shortest interconnecting network for a finite set of points in a metric space. A solution must be a tree, which is called a Steiner Minimal Tree (SMT), and may contain vertices different from the points which are to be connected. Steiner's Problem is one of the most famous combinatorial-geometrical problems, but unfortunately it is very difficult in terms of combinatorial structure as well as computational complexity. However, if only a Minimum Spanning Tree (MST) without additional vertices in the interconnecting network is sought, then it is simple to solve. So it is of interest to know what the error is if an MST is constructed instead of an SMT. The worst case for this ratio running over all finite sets is called the Steiner ratio of the space. The book concentrates on investigating the Steiner ratio. The goal is to determine, or at least estimate, the Steiner ratio for many different metric spaces. The author shows that the description of the Steiner ratio contains many questions from geometry, optimization, and graph theory. Audience: Researchers in network design, applied optimization, and design of algorithms.

The Steiner Tree Problem
The Steiner Tree Problem

Author: F.K. Hwang

Publisher: Elsevier

Published: 1992-10-20

Total Pages: 353

ISBN-13: 0080867936

DOWNLOAD EBOOK

The Steiner problem asks for a shortest network which spans a given set of points. Minimum spanning networks have been well-studied when all connections are required to be between the given points. The novelty of the Steiner tree problem is that new auxiliary points can be introduced between the original points so that a spanning network of all the points will be shorter than otherwise possible. These new points are called Steiner points - locating them has proved problematic and research has diverged along many different avenues.This volume is devoted to the assimilation of the rich field of intriguing analyses and the consolidation of the fragments. A section has been given to each of the three major areas of interest which have emerged. The first concerns the Euclidean Steiner Problem, historically the original Steiner tree problem proposed by Jarník and Kössler in 1934. The second deals with the Steiner Problem in Networks, which was propounded independently by Hakimi and Levin and has enjoyed the most prolific research amongst the three areas. The Rectilinear Steiner Problem, introduced by Hanan in 1965, is discussed in the third part. Additionally, a forth section has been included, with chapters discussing areas where the body of results is still emerging.The collaboration of three authors with different styles and outlooks affords individual insights within a cohesive whole.

Steiner Tree Problems in Computer Communication Networks
Steiner Tree Problems in Computer Communication Networks

Author: Dingzhu Du

Publisher: World Scientific

Published: 2008-01-01

Total Pages: 373

ISBN-13: 9812791450

DOWNLOAD EBOOK

The Steiner tree problem is one of the most important combinatorial optimization problems. It has a long history that can be traced back to the famous mathematician Fermat (1601-1665). This book studies three significant breakthroughs on the Steiner tree problem that were achieved in the 1990s, and some important applications of Steiner tree problems in computer communication networks researched in the past fifteen years. It not only covers some of the most recent developments in Steiner tree problems, but also discusses various combinatorial optimization methods, thus providing a balance between theory and practice. Sample Chapter(s). Chapter 1: Minimax Approach and Steiner Ratio (372 KB). Contents: Minimax Approach and Steiner Ratio; k -Steiner Ratios and Better Approximation Algorithms; Geometric Partitions and Polynomial Time Approximation Schemes; Grade of Service Steiner Tree Problem; Steiner Tree Problem for Minimal Steiner Points; Bottleneck Steiner Tree Problem; Steiner k -Tree and k -Path Routing Problems; Steiner Tree Coloring Problem; Steiner Tree Scheduling Problem; Survivable Steiner Network Problem. Readership: Researchers and graduate students of computer science and engineering as well as operations research.

Handbook of Graph Theory, Combinatorial Optimization, and Algorithms
Handbook of Graph Theory, Combinatorial Optimization, and Algorithms

Author: Krishnaiyan "KT" Thulasiraman

Publisher: CRC Press

Published: 2016-01-05

Total Pages: 1217

ISBN-13: 1420011073

DOWNLOAD EBOOK

The fusion between graph theory and combinatorial optimization has led to theoretically profound and practically useful algorithms, yet there is no book that currently covers both areas together. Handbook of Graph Theory, Combinatorial Optimization, and Algorithms is the first to present a unified, comprehensive treatment of both graph theory and c

Complexity in Numerical Optimization
Complexity in Numerical Optimization

Author: Panos M. Pardalos

Publisher: World Scientific

Published: 1993

Total Pages: 536

ISBN-13: 9789810214159

DOWNLOAD EBOOK

Computational complexity, originated from the interactions between computer science and numerical optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty.The main focus of complexity is the study of whether existing algorithms are efficient for the solution of problems, and which problems are likely to be tractable.The quest for developing efficient algorithms leads also to elegant general approaches for solving optimization problems, and reveals surprising connections among problems and their solutions.This book is a collection of articles on recent complexity developments in numerical optimization. The topics covered include complexity of approximation algorithms, new polynomial time algorithms for convex quadratic minimization, interior point algorithms, complexity issues regarding test generation of NP-hard problems, complexity of scheduling problems, min-max, fractional combinatorial optimization, fixed point computations and network flow problems.The collection of articles provide a broad spectrum of the direction in which research is going and help to elucidate the nature of computational complexity in optimization. The book will be a valuable source of information to faculty, students and researchers in numerical optimization and related areas.

Handbook of Combinatorial Optimization
Handbook of Combinatorial Optimization

Author: Ding-Zhu Du

Publisher: Springer Science & Business Media

Published: 2006-08-18

Total Pages: 395

ISBN-13: 0387238301

DOWNLOAD EBOOK

This is a supplementary volume to the major three-volume Handbook of Combinatorial Optimization set. It can also be regarded as a stand-alone volume presenting chapters dealing with various aspects of the subject in a self-contained way.

Steiner Trees in Industry
Steiner Trees in Industry

Author: Xiuzhen Cheng

Publisher: Springer Science & Business Media

Published: 2013-12-01

Total Pages: 508

ISBN-13: 1461302552

DOWNLOAD EBOOK

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.

Encyclopedia of Optimization
Encyclopedia of Optimization

Author: Christodoulos A. Floudas

Publisher: Springer Science & Business Media

Published: 2008-09-04

Total Pages: 4646

ISBN-13: 0387747583

DOWNLOAD EBOOK

The goal of the Encyclopedia of Optimization is to introduce the reader to a complete set of topics that show the spectrum of research, the richness of ideas, and the breadth of applications that has come from this field. The second edition builds on the success of the former edition with more than 150 completely new entries, designed to ensure that the reference addresses recent areas where optimization theories and techniques have advanced. Particularly heavy attention resulted in health science and transportation, with entries such as "Algorithms for Genomics", "Optimization and Radiotherapy Treatment Design", and "Crew Scheduling".

Computing in Euclidean Geometry
Computing in Euclidean Geometry

Author: Ding-Zhu Du

Publisher: World Scientific

Published: 1995

Total Pages: 520

ISBN-13: 9789810218768

DOWNLOAD EBOOK

This book is a collection of surveys and exploratory articles about recent developments in the field of computational Euclidean geometry. Topics covered include the history of Euclidean geometry, Voronoi diagrams, randomized geometric algorithms, computational algebra, triangulations, machine proofs, topological designs, finite-element mesh, computer-aided geometric designs and Steiner trees. This second edition contains three new surveys covering geometric constraint solving, computational geometry and the exact computation paradigm.

Handbook of Global Optimization
Handbook of Global Optimization

Author: R. Horst

Publisher: Springer Science & Business Media

Published: 2013-12-11

Total Pages: 891

ISBN-13: 1461520258

DOWNLOAD EBOOK

Global optimization is concerned with the computation and characterization of global optima of nonlinear functions. During the past three decades the field of global optimization has been growing at a rapid pace, and the number of publications on all aspects of global optimization has been increasing steadily. Many applications, as well as new theoretical, algorithmic, and computational contributions have resulted. The Handbook of Global Optimization is the first comprehensive book to cover recent developments in global optimization. Each contribution in the Handbook is essentially expository in nature, but scholarly in its treatment. The chapters cover optimality conditions, complexity results, concave minimization, DC programming, general quadratic programming, nonlinear complementarity, minimax problems, multiplicative programming, Lipschitz optimization, fractional programming, network problems, trajectory methods, homotopy methods, interval methods, and stochastic approaches. The Handbook of Global Optimization is addressed to researchers in mathematical programming, as well as all scientists who use optimization methods to model and solve problems.