3 papers
cs.DS2025
Flow-weighted Layered Metric Euclidean Capacitated Steiner Tree Problem
Thomas Bläsius, Henrik Csöre, Max Göttlicher +2
Motivated by hierarchical networks, we introduce the Flow-weighted Layered Metric Euclidean Capacitated Steiner Tree (FLaMECaST) problem, a variant of the Euclidean Steiner tree wi…
cs.DS2024
The Constrained Layer Tree Problem and Applications to Solar Farm Cabling
Thomas Bläsius, Max Göttlicher, Sascha Gritzbach +1
Motivated by the cabling of solar farms, we study the problem Constrained Layer Tree. At its core, it asks whether there exists a tree that connects a set of sources (the leaves) t…
cs.DS2023
An Efficient Algorithm for Power Dominating Set
Thomas Bläsius, Max Göttlicher
The problem Power Dominating Set (PDS) is motivated by the placement of phasor measurement units to monitor electrical networks. It asks for a minimum set of vertices in a graph th…