Ras, Charl J., Swanepoel, Konrad J. and Thomas, Doreen (2017) Approximate Euclidean Steiner trees. Journal of Optimization Theory and Applications, 172 (3). pp. 845873. ISSN 00223239

Text
 Published Version
Available under License Creative Commons Attribution. Download (999kB)  Preview 
Abstract
An approximate Steiner tree is a Steiner tree on a given set of terminals in Euclidean space such that the angles at the Steiner points are within a specified error e from 120 degrees. This notion arises in numerical approximations of minimum Steiner trees (W. D. Smith, Algorithmica, 7 (1992), 137–177). We investigate the worstcase relative error of the length of an approximate Steiner tree compared to the shortest tree with the same topology. Rubinstein, Weng and Wormald (J. Global Optim. 35 (2006), 573–592) conjectured that this relative error is at most linear in e, independent of the number of terminals. We verify their conjecture for the twodimensional case as long as the error e is sufficiently small in terms of the number of terminals. We derive a lower bound linear in e for the relative error in the twodimensional case when e is sufficiently small in terms of the number of terminals. We find improved estimates of the relative error for larger values of e, and calculate exact values in the plane for three and four terminals.
Item Type:  Article 

Official URL:  http://www.springer.com/mathematics/journal/10957 
Additional Information:  © 2016 The Authors © CC BY 4.0 
Divisions:  Mathematics 
Subjects:  Q Science > QA Mathematics 
Sets:  Departments > Mathematics 
Date Deposited:  23 Nov 2016 12:22 
Last Modified:  10 Jul 2019 11:42 
URI:  http://eprints.lse.ac.uk/id/eprint/68334 
Actions (login required)
View Item 