1 citations · 1 across the 2 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2022★ 1 cited
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…
cs.DS2020
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…
cs.DS2018
Vehicle Routing with Subtours
Stephan Held, Jochen Könemann, Jens Vygen
When delivering items to a set of destinations, one can save time and cost by passing a subset to a sub-contractor at any point en route. We consider a model where a set of items a…