Advances in Steiner Trees

Advances in Steiner Trees edited by Ding-Zhu Du, J.M. Smith, J. Hyam Rubinstein.

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...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Du, Ding-Zhu (Editor), Smith, J.M (Editor), Rubinstein, J. Hyam (Editor)
Format: eBook
Language:English
Published: New York, NY : Springer US : Imprint: Springer, 2000.
Edition:1st ed. 2000.
Series:Combinatorial Optimization, 6
Springer eBook Collection.
Subjects:
Combinatorics.
Computers.
Algorithms.
Mathematical optimization.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Description
Summary: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.
Physical Description:XII, 323 p. online resource.
ISBN:9781475731712
ISSN:1388-3011 ;
DOI:10.1007/978-1-4757-3171-2

Similar Items