Faster exact algorithms for computing Steiner trees in higher dimensional Euclidean spaces

Research output: Contribution to conferencePaperResearch


Rasmus Fonseca, Marcus Brazil, Pawel Winter, Martin Zachariasen

The Euclidean Steiner tree problem asks for a network of minimum total length interconnecting a finite set of points in d-dimensional space. For d ≥ 3, only one practical algorithmic approach exists for this problem --- proposed by Smith in 1992. A number of refinements of Smith's algorithm have increased the range of solvable problems a little, but it is still infeasible to solve problem instances with more than around 17 terminals. In this paper we firstly propose some additional improvements to Smith's algorithm. Secondly, we propose a new algorithmic paradigm called branch enumeration. Our experiments show that branch enumeration has similar performance as an optimized version of Smith's algorithm; furthermore, we argue that branch enumeration has the potential to push the boundary of solvable problems further.
Original languageEnglish
Publication date2014
Number of pages20
Publication statusPublished - 2014
Event11th DIMACS Implementation Challenge - ICERM, Providence, United States
Duration: 4 Dec 20145 Dec 2014
Conference number: 11


Conference11th DIMACS Implementation Challenge
CountryUnited States

    Research areas

  • The Faculty of Science - Steiner tree problem, d-dimensional Euclidean space, exact algorithm, computational study

Number of downloads are based on statistics from Google Scholar and

No data available

ID: 137038070