Flow-weighted Layered Metric Euclidean Capacitated Steiner Tree Problem
Abstract
Motivated by hierarchical networks, we introduce the Flow-weighted Layered Metric Euclidean Capacitated Steiner Tree (FLaMECaST) problem, a variant of the Euclidean Steiner tree with layered structure and capacity constraints per layer. The goal is to construct a cost-optimal Steiner forest connecting a set of sources to a set of sinks under load-dependent edge costs. We prove that FLaMECaST is NP-hard to approximate, even in restricted cases where all sources lie on a circle. However, assuming few additional constraints for such instances, we design a dynamic program that achieves a -approximation in polynomial time. By generalizing the structural insights the dynamic program is based on, we extend the approach to certain settings, where all sources are positioned on a convex polygon.
Cite
@article{arxiv.2508.20041,
title = {Flow-weighted Layered Metric Euclidean Capacitated Steiner Tree Problem},
author = {Thomas Bläsius and Henrik Csöre and Max Göttlicher and Elly Schmidt and Wendy Yi},
journal= {arXiv preprint arXiv:2508.20041},
year = {2025}
}