Faster exact algorithms for computing Steiner trees in higher dimensional Euclidean spaces
Publikation: Konferencebidrag › Paper › Forskning
Dokumenter
- Fonseca_2015_Faster_exact_algorithms
Indsendt manuskript, 453 KB, PDF-dokument
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.
Originalsprog | Engelsk |
---|---|
Publikationsdato | 2014 |
Antal sider | 20 |
Status | Udgivet - 2014 |
Begivenhed | 11th DIMACS Implementation Challenge - ICERM, Providence, USA Varighed: 4 dec. 2014 → 5 dec. 2014 Konferencens nummer: 11 |
Konference
Konference | 11th DIMACS Implementation Challenge |
---|---|
Nummer | 11 |
Lokation | ICERM |
Land | USA |
By | Providence |
Periode | 04/12/2014 → 05/12/2014 |
- Det Natur- og Biovidenskabelige Fakultet
Forskningsområder
Links
- http://dimacs11.zib.de/workshop/FonsecaBrazilWinterZachariasen.pdf
Indsendt manuskript
Antal downloads er baseret på statistik fra Google Scholar og www.ku.dk
Ingen data tilgængelig
ID: 137038070