Paper
A Fast Heuristic for Stochastic Steiner Tree Problems
Authors
Berend Markhorst, Alessandro Zocca, Joost Berkhout, Rob van der Mei
Abstract
Network design under uncertainty arises in countless real-world settings and can be captured by the Stochastic Steiner Tree Problem (SSTP). Although there are a few approaches specifically tailored to this stochastic optimization problem, there are considerably more state-of-the-art heuristics for its deterministic variant, the Steiner Tree Problem (STP). In this work, we show how to leverage an existing STP heuristic in building a novel method for solving its stochastic variant, the SSTP. This approach is a powerful, yet simple and easy-to-implement way of solving this complex problem. We test our method using benchmark instances from the literature. Numerical results show considerably faster computation times compared to the state-of-the-art, with a gap of approximately 5%.
Metadata
Related papers
Fractal universe and quantum gravity made simple
Fabio Briscese, Gianluca Calcagni • 2026-03-25
POLY-SIM: Polyglot Speaker Identification with Missing Modality Grand Challenge 2026 Evaluation Plan
Marta Moscati, Muhammad Saad Saeed, Marina Zanoni, Mubashir Noman, Rohan Kuma... • 2026-03-25
LensWalk: Agentic Video Understanding by Planning How You See in Videos
Keliang Li, Yansong Li, Hongze Shen, Mengdi Liu, Hong Chang, Shiguang Shan • 2026-03-25
Orientation Reconstruction of Proteins using Coulomb Explosions
Tomas André, Alfredo Bellisario, Nicusor Timneanu, Carl Caleman • 2026-03-25
The role of spatial context and multitask learning in the detection of organic and conventional farming systems based on Sentinel-2 time series
Jan Hemmerling, Marcel Schwieder, Philippe Rufin, Leon-Friedrich Thomas, Mire... • 2026-03-25
Raw Data (Debug)
{
"raw_xml": "<entry>\n <id>http://arxiv.org/abs/2602.23858v1</id>\n <title>A Fast Heuristic for Stochastic Steiner Tree Problems</title>\n <updated>2026-02-27T09:56:24Z</updated>\n <link href='https://arxiv.org/abs/2602.23858v1' rel='alternate' type='text/html'/>\n <link href='https://arxiv.org/pdf/2602.23858v1' rel='related' title='pdf' type='application/pdf'/>\n <summary>Network design under uncertainty arises in countless real-world settings and can be captured by the Stochastic Steiner Tree Problem (SSTP). Although there are a few approaches specifically tailored to this stochastic optimization problem, there are considerably more state-of-the-art heuristics for its deterministic variant, the Steiner Tree Problem (STP). In this work, we show how to leverage an existing STP heuristic in building a novel method for solving its stochastic variant, the SSTP. This approach is a powerful, yet simple and easy-to-implement way of solving this complex problem. We test our method using benchmark instances from the literature. Numerical results show considerably faster computation times compared to the state-of-the-art, with a gap of approximately 5%.</summary>\n <category scheme='http://arxiv.org/schemas/atom' term='math.OC'/>\n <published>2026-02-27T09:56:24Z</published>\n <arxiv:primary_category term='math.OC'/>\n <author>\n <name>Berend Markhorst</name>\n </author>\n <author>\n <name>Alessandro Zocca</name>\n </author>\n <author>\n <name>Joost Berkhout</name>\n </author>\n <author>\n <name>Rob van der Mei</name>\n </author>\n </entry>"
}