6 papers
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…
Assortativity in geometric and scale-free networks
Marc Kaufmann, Ulysse Schaller, Thomas Bläsius +1
The assortative behavior of a network is the tendency of similar (or dissimilar) nodes to connect to each other. This tendency can have an influence on various properties of the ne…
Customizable Contraction Hierarchies -- A Survey
Thomas Bläsius, Valentin Buchhold, Dorothea Wagner +2
This work establishes the technical fundamentals of a well-tuned Customizable Contraction Hierarchies (CCH) implementation that is simple and elegant. We give a detailed overview o…
Synergistic Traffic Assignment
Thomas Bläsius, Adrian Feilhauer, Markus Jung +3
Traffic assignment analyzes traffic flows in road networks that emerge due to traveler interaction. Traditionally, travelers are assumed to use private cars, so road costs grow wit…
Efficient Uniform Negative Edge Weights
Lukas Geis, Daniel Allendorf, Thomas Bläsius +4
We consider a maximum entropy edge weight model that allows for negative weights. Given a graph and possible weights typically consisting of positive and negative…
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…