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.

Handbook of Combinatorial Optimization
Handbook of Combinatorial Optimization

Author: Ding-Zhu Du

Publisher: Springer Science & Business Media

Published: 2013-12-01

Total Pages: 2410

ISBN-13: 1461303036

DOWNLOAD EBOOK

Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air line crew scheduling, corporate planning, computer-aided design and man ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, alloca tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the Nobel Prize (1975) for their work on the optimal allocation of resources. Two important discover ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These algo rithms have had a profound effect in combinatorial optimization. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. matching and maximum flow). In addi tion, linear programming relaxations are often the basis for many approxi mation algorithms for solving NP-hard problems (e.g. dual heuristics).

Handbook of combinatorial optimization
Handbook of combinatorial optimization

Author: Dingzhu Du

Publisher: Springer Science & Business Media

Published: 1998-12-15

Total Pages: 774

ISBN-13: 9780792352938

DOWNLOAD EBOOK

This is the second of a multi-volume set. The various volumes deal with several algorithmic approaches for discrete problems as well as with many combinatorial problems. The emphasis is on late-1990s developments. Each chapter is essentially expository in nature, but scholarly in its treatment.

Optimal Interconnection Trees in the Plane
Optimal Interconnection Trees in the Plane

Author: Marcus Brazil

Publisher: Springer

Published: 2015-04-13

Total Pages: 359

ISBN-13: 3319139150

DOWNLOAD EBOOK

This book explores fundamental aspects of geometric network optimisation with applications to a variety of real world problems. It presents, for the first time in the literature, a cohesive mathematical framework within which the properties of such optimal interconnection networks can be understood across a wide range of metrics and cost functions. The book makes use of this mathematical theory to develop efficient algorithms for constructing such networks, with an emphasis on exact solutions. Marcus Brazil and Martin Zachariasen focus principally on the geometric structure of optimal interconnection networks, also known as Steiner trees, in the plane. They show readers how an understanding of this structure can lead to practical exact algorithms for constructing such trees. The book also details numerous breakthroughs in this area over the past 20 years, features clearly written proofs, and is supported by 135 colour and 15 black and white figures. It will help graduate students, working mathematicians, engineers and computer scientists to understand the principles required for designing interconnection networks in the plane that are as cost efficient as possible.

Computational Geometry
Computational Geometry

Author: Franco P. Preparata

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 413

ISBN-13: 1461210984

DOWNLOAD EBOOK

From the reviews: "This book offers a coherent treatment, at the graduate textbook level, of the field that has come to be known in the last decade or so as computational geometry. ... ... The book is well organized and lucidly written; a timely contribution by two founders of the field. It clearly demonstrates that computational geometry in the plane is now a fairly well-understood branch of computer science and mathematics. It also points the way to the solution of the more challenging problems in dimensions higher than two." #Mathematical Reviews#1 "... This remarkable book is a comprehensive and systematic study on research results obtained especially in the last ten years. The very clear presentation concentrates on basic ideas, fundamental combinatorial structures, and crucial algorithmic techniques. The plenty of results is clever organized following these guidelines and within the framework of some detailed case studies. A large number of figures and examples also aid the understanding of the material. Therefore, it can be highly recommended as an early graduate text but it should prove also to be essential to researchers and professionals in applied fields of computer-aided design, computer graphics, and robotics." #Biometrical Journal#2

Machine Proofs in Geometry
Machine Proofs in Geometry

Author: Shang-Ching Chou

Publisher: World Scientific

Published: 1994

Total Pages: 490

ISBN-13: 9789810215842

DOWNLOAD EBOOK

This book reports recent major advances in automated reasoning in geometry. The authors have developed a method and implemented a computer program which, for the first time, produces short and readable proofs for hundreds of geometry theorems.The book begins with chapters introducing the method at an elementary level, which are accessible to high school students; latter chapters concentrate on the main theme: the algorithms and computer implementation of the method.This book brings researchers in artificial intelligence, computer science and mathematics to a new research frontier of automated geometry reasoning. In addition, it can be used as a supplementary geometry textbook for students, teachers and geometers. By presenting a systematic way of proving geometry theorems, it makes the learning and teaching of geometry easier and may change the way of geometry education.

Research Problems in Discrete Geometry
Research Problems in Discrete Geometry

Author: Peter Brass

Publisher: Springer Science & Business Media

Published: 2006-01-27

Total Pages: 507

ISBN-13: 0387299297

DOWNLOAD EBOOK

This book is the result of a 25-year-old project and comprises a collection of more than 500 attractive open problems in the field. The largely self-contained chapters provide a broad overview of discrete geometry, along with historical details and the most important partial results related to these problems. This book is intended as a source book for both professional mathematicians and graduate students who love beautiful mathematical questions, are willing to spend sleepless nights thinking about them, and who would like to get involved in mathematical research.

Computational Geometry
Computational Geometry

Author: Mark de Berg

Publisher: Springer Science & Business Media

Published: 2013-04-17

Total Pages: 370

ISBN-13: 3662042452

DOWNLOAD EBOOK

This introduction to computational geometry focuses on algorithms. Motivation is provided from the application areas as all techniques are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems. Modern insights in computational geometry are used to provide solutions that are both efficient and easy to understand and implement.

Visual Form 2001
Visual Form 2001

Author: Carlo Arcelli

Publisher: Springer

Published: 2003-06-29

Total Pages: 798

ISBN-13: 3540451293

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 4th International Workshop on Visual Form, IWVF-4, held in Capri, Italy, in May 2001. The 66 revised full papers presented together with seven invited papers were carefully reviewed and selected from 117 submissions. The book covers theoretical and applicative aspects of visual form processing. The papers are organized in topical sections on representation, analysis, recognition, modelling and retrieval, and applications.

Mobile Ad Hoc Networking
Mobile Ad Hoc Networking

Author: Stefano Basagni

Publisher: John Wiley & Sons

Published: 2013-02-07

Total Pages: 690

ISBN-13: 1118511239

DOWNLOAD EBOOK

"An excellent book for those who are interested in learning the current status of research and development . . . [and] who want to get a comprehensive overview of the current state-of-the-art." —E-Streams This book provides up-to-date information on research and development in the rapidly growing area of networks based on the multihop ad hoc networking paradigm. It reviews all classes of networks that have successfully adopted this paradigm, pointing out how they penetrated the mass market and sparked breakthrough research. Covering both physical issues and applications, Mobile Ad Hoc Networking: Cutting Edge Directions offers useful tools for professionals and researchers in diverse areas wishing to learn about the latest trends in sensor, actuator, and robot networking, mesh networks, delay tolerant and opportunistic networking, and vehicular networks. Chapter coverage includes: Multihop ad hoc networking Enabling technologies and standards for mobile multihop wireless networking Resource optimization in multiradio multichannel wireless mesh networks QoS in mesh networks Routing and data dissemination in opportunistic networks Task farming in crowd computing Mobility models, topology, and simulations in VANET MAC protocols for VANET Wireless sensor networks with energy harvesting nodes Robot-assisted wireless sensor networks: recent applications and future challenges Advances in underwater acoustic networking Security in wireless ad hoc networks Mobile Ad Hoc Networking will appeal to researchers, developers, and students interested in computer science, electrical engineering, and telecommunications.