Author : Hans Jürgen Prömel
Publisher : Springer Science & Business Media
Page : 251 pages
File Size : 41,23 MB
Release : 2012-12-06
Category : Mathematics
ISBN : 3322802914
In recent years, algorithmic graph theory has become increasingly important as a link between discrete mathematics and theoretical computer science. This textbook introduces students of mathematics and computer science to the interrelated fields of graphs theory, algorithms and complexity.
Author : F.K. Hwang
Publisher : Elsevier
Page : 353 pages
File Size : 13,79 MB
Release : 1992-10-20
Category : Computers
ISBN : 0080867936
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.
Author : Dingzhu Du
Publisher : World Scientific
Page : 373 pages
File Size : 16,21 MB
Release : 2008
Category : Computers
ISBN : 9812791442
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.
Author : Bang Ye Wu
Publisher : CRC Press
Page : 199 pages
File Size : 44,23 MB
Release : 2004-01-27
Category : Computers
ISBN : 0203497287
The design of approximation algorithms for spanning tree problems has become an exciting and important area of theoretical computer science and also plays a significant role in emerging fields such as biological sequence alignments and evolutionary tree construction. While work in this field remains quite active, the time has come to collect under
Author : Ding-Zhu Du
Publisher : Springer Science & Business Media
Page : 329 pages
File Size : 26,42 MB
Release : 2013-06-29
Category : Mathematics
ISBN : 147573171X
The Volume on Advances in Steiner Trees is divided into two sections. The first section of the book includes papers on the general geometric Steiner tree problem in the plane and higher dimensions. The second section of the book includes papers on the Steiner problem on graphs. The general geometric Steiner tree problem assumes that you have a given set of points in some d-dimensional space and you wish to connect the given points with the shortest network possible. The given set ofpoints are 3 Figure 1: Euclidean Steiner Problem in E usually referred to as terminals and the set ofpoints that may be added to reduce the overall length of the network are referred to as Steiner points. What makes the problem difficult is that we do not know a priori the location and cardinality ofthe number ofSteiner points. Thus)the problem on the Euclidean metric is not known to be in NP and has not been shown to be NP-Complete. It is thus a very difficult NP-Hard problem.
Author : Xiuzhen Cheng
Publisher : Springer Science & Business Media
Page : 508 pages
File Size : 32,14 MB
Release : 2013-12-01
Category : Computers
ISBN : 1461302552
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.
Author : J.R. Sack
Publisher : Elsevier
Page : 1087 pages
File Size : 17,31 MB
Release : 1999-12-13
Category : Mathematics
ISBN : 0080529682
Computational Geometry is an area that provides solutions to geometric problems which arise in applications including Geographic Information Systems, Robotics and Computer Graphics. This Handbook provides an overview of key concepts and results in Computational Geometry. It may serve as a reference and study guide to the field. Not only the most advanced methods or solutions are described, but also many alternate ways of looking at problems and how to solve them.
Author : Natalio Krasnogor
Publisher : Springer
Page : 520 pages
File Size : 49,14 MB
Release : 2008-06-03
Category : Computers
ISBN : 3540789871
Biological and natural processes have been a continuous source of inspiration for the sciences and engineering. For instance, the work of Wiener in cybernetics was influenced by feedback control processes observable in biological systems; McCulloch and Pitts description of the artificial neuron was instigated by biological observations of neural mechanisms; the idea of survival of the fittest inspired the field of evolutionary algorithms and similarly, artificial immune systems, ant colony optimisation, automated self-assembling programming, membrane computing, etc. also have their roots in natural phenomena. The second International Workshop on Nature Inspired Cooperative Strategies for Optimization (NICSO), was held in Acireale, Italy, during November 8-10, 2007. The aim for NICSO 2007 was to provide a forum were the latest ideas and state of the art research related to cooperative strategies for problem solving arising from Nature could be discussed. The contributions collected in this book were strictly peer reviewed by at least three members of the international programme committee, to whom we are indebted for their support and assistance. The topics covered by the contributions include several well established nature inspired techniques like Genetic Algorithms, Ant Colonies, Artificial Immune Systems, Evolutionary Robotics, Evolvable Systems, Membrane Computing, Quantum Computing, Software Self Assembly, Swarm Intelligence, etc.
Author : Ming-Yang Kao
Publisher : Springer Science & Business Media
Page : 1200 pages
File Size : 35,83 MB
Release : 2008-08-06
Category : Computers
ISBN : 0387307702
One of Springer’s renowned Major Reference Works, this awesome achievement provides a comprehensive set of solutions to important algorithmic problems for students and researchers interested in quickly locating useful information. This first edition of the reference focuses on high-impact solutions from the most recent decade, while later editions will widen the scope of the work. All entries have been written by experts, while links to Internet sites that outline their research work are provided. The entries have all been peer-reviewed. This defining reference is published both in print and on line.
Author : Janis S. Neufeld
Publisher : Springer Nature
Page : 734 pages
File Size : 22,60 MB
Release : 2020-09-24
Category : Business & Economics
ISBN : 3030484394
This book gathers a selection of peer-reviewed papers presented at the International Conference on Operations Research (OR 2019), which was held at Technische Universität Dresden, Germany, on September 4-6, 2019, and was jointly organized by the German Operations Research Society (GOR) the Austrian Operations Research Society (ÖGOR), and the Swiss Operational Research Society (SOR/ASRO). More than 600 scientists, practitioners and students from mathematics, computer science, business/economics and related fields attended the conference and presented more than 400 papers in plenary presentations, parallel topic streams, as well as special award sessions. The respective papers discuss classical mathematical optimization, statistics and simulation techniques. These are complemented by computer science methods, and by tools for processing data, designing and implementing information systems. The book also examines recent advances in information technology, which allow big data volumes to be processed and enable real-time predictive and prescriptive business analytics to drive decisions and actions. Lastly, it includes problems modeled and treated while taking into account uncertainty, risk management, behavioral issues, etc.
