2 citations · 5 across the 7 of their papers we have counts for
10 papers
Cost-Distance Steiner Trees for Timing-Constrained Global Routing
Stephan Held, Edgar Perner
The cost-distance Steiner tree problem seeks a Steiner tree that minimizes the total congestion cost plus the weighted sum of source-sink delays. This problem arises as a subroutin…
Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem
Josefine Foos, Stephan Held, Yannik Kyle Dustin Spitzley
Uniform cost-distance Steiner trees minimize the sum of the total length and weighted path lengths from a dedicated root to the other terminals. They are applied when the tree is i…
Further Improvements on Approximating the Uniform Cost-Distance Steiner Tree Problem
Stephan Held, Yannik Kyle Dustin Spitzley
In this paper, we consider the Uniform Cost-Distance Steiner Tree Problem in metric spaces, a generalization of the well-known Steiner tree problem. Cost-distance Steiner trees min…
Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks
Jannis Blauth, Stephan Held, Dirk Müller +4
We develop theoretical foundations and practical algorithms for vehicle routing with time-dependent travel times. We also provide new benchmark instances and experimental results.…
Constrained Local Search for Last-Mile Routing
William Cook, Stephan Held, Keld Helsgaun
Last-mile routing refers to the final step in a supply chain, delivering packages from a depot station to the homes of customers. At the level of a single van driver, the task is a…
Approximating the discrete time-cost tradeoff problem with bounded depth
Siad Daboul, Stephan Held, Jens Vygen
We revisit the deadline version of the discrete time-cost tradeoff problem for the special case of bounded depth. Such instances occur for example in VLSI design. The depth of an i…