The GeoSteiner Software Package for computing Steiner trees in the plane: an updated computational study

Daniel Dahl Juhl, David M. Warme, Pawel Winter, Martin Zachariasen

Research output: Contribution to conference without publisher/journalPaperResearchpeer-review

Abstract

The GeoSteiner software package has for more than 10 years been the fastest (publicly available) program for computing exact solutions to Steiner tree problems in the plane. The computational study by Warme, Winter and Zachariasen, published in 2000, documented the performance of the GeoSteiner approach --- allowing the exact solution of Steiner tree problems with more than a thousand terminals. Since then, a number of algorithmic enhancements have improved the performance of the software package significantly. In this computational study we run the current code on the largest problem instances from the 2000-study, and on a number of larger problem instances. The computational study is performed using both the publicly available GeoSteiner 3.1 code base, and the commercial GeoSteiner 4.0 code base.
Original languageEnglish
Publication date2014
Number of pages30
Publication statusPublished - 2014
Externally publishedYes

Fingerprint

Software packages

Cite this

Juhl, Daniel Dahl ; Warme, David M. ; Winter, Pawel ; Zachariasen, Martin. / The GeoSteiner Software Package for computing Steiner trees in the plane: an updated computational study. 30 p.
@conference{3f0fdd5d9e254ab39059b3baf4ce706d,
title = "The GeoSteiner Software Package for computing Steiner trees in the plane: an updated computational study",
abstract = "The GeoSteiner software package has for more than 10 years been the fastest (publicly available) program for computing exact solutions to Steiner tree problems in the plane. The computational study by Warme, Winter and Zachariasen, published in 2000, documented the performance of the GeoSteiner approach --- allowing the exact solution of Steiner tree problems with more than a thousand terminals. Since then, a number of algorithmic enhancements have improved the performance of the software package significantly. In this computational study we run the current code on the largest problem instances from the 2000-study, and on a number of larger problem instances. The computational study is performed using both the publicly available GeoSteiner 3.1 code base, and the commercial GeoSteiner 4.0 code base.",
author = "Juhl, {Daniel Dahl} and Warme, {David M.} and Pawel Winter and Martin Zachariasen",
year = "2014",
language = "English",

}

The GeoSteiner Software Package for computing Steiner trees in the plane: an updated computational study. / Juhl, Daniel Dahl; Warme, David M.; Winter, Pawel; Zachariasen, Martin.

2014.

Research output: Contribution to conference without publisher/journalPaperResearchpeer-review

TY - CONF

T1 - The GeoSteiner Software Package for computing Steiner trees in the plane: an updated computational study

AU - Juhl, Daniel Dahl

AU - Warme, David M.

AU - Winter, Pawel

AU - Zachariasen, Martin

PY - 2014

Y1 - 2014

N2 - The GeoSteiner software package has for more than 10 years been the fastest (publicly available) program for computing exact solutions to Steiner tree problems in the plane. The computational study by Warme, Winter and Zachariasen, published in 2000, documented the performance of the GeoSteiner approach --- allowing the exact solution of Steiner tree problems with more than a thousand terminals. Since then, a number of algorithmic enhancements have improved the performance of the software package significantly. In this computational study we run the current code on the largest problem instances from the 2000-study, and on a number of larger problem instances. The computational study is performed using both the publicly available GeoSteiner 3.1 code base, and the commercial GeoSteiner 4.0 code base.

AB - The GeoSteiner software package has for more than 10 years been the fastest (publicly available) program for computing exact solutions to Steiner tree problems in the plane. The computational study by Warme, Winter and Zachariasen, published in 2000, documented the performance of the GeoSteiner approach --- allowing the exact solution of Steiner tree problems with more than a thousand terminals. Since then, a number of algorithmic enhancements have improved the performance of the software package significantly. In this computational study we run the current code on the largest problem instances from the 2000-study, and on a number of larger problem instances. The computational study is performed using both the publicly available GeoSteiner 3.1 code base, and the commercial GeoSteiner 4.0 code base.

M3 - Paper

ER -