Stephan Held

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Tighter approximation for the uniform cost-distance Steiner tree problem	2025-01-14	Paper
Vehicle routing with time-dependent travel times: theory, practice, and benchmarks Discrete Optimization	2024-09-11	Paper
Approximating the discrete time-cost tradeoff problem with bounded depth Mathematical Programming. Series A. Series B	2023-03-14	Paper
An improved approximation algorithm for the uniform cost-distance Steiner tree problem	2022-03-22	Paper
Constrained Local Search for Last-Mile Routing	2021-12-30	Paper
Approximating the discrete time-cost tradeoff problem with bounded depth Integer Programming and Combinatorial Optimization	2021-12-21	Paper
Vehicle routing with subtours Discrete Optimization	2019-11-28	Paper
Binary adder circuits of asymptotically minimum depth, linear size, and fan-out two ACM Transactions on Algorithms	2018-11-12	Paper
The repeater tree construction problem Information Processing Letters	2017-11-03	Paper
Two-level rectilinear Steiner trees Computational Geometry	2017-07-05	Paper
Fast prefix adders for non-uniform input arrival times Algorithmica	2017-03-06	Paper
Combinatorial optimization in VLSI design	2014-11-10	Paper
Maximum-weight stable sets and safe lower bounds for graph coloring Mathematical Programming Computation	2013-04-10	Paper
Shallow-light Steiner arborescences with vertex delays Integer Programming and Combinatorial Optimization	2013-03-19	Paper
Safe lower bounds for graph coloring Integer Programming and Combinatoral Optimization	2011-06-24	Paper

Research outcomes over time

This page was built for person: Stephan Held