Stephan Held

Available identifiers

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	2024-09-11	Paper
Approximating the discrete time-cost tradeoff problem with bounded depth	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	2021-12-21	Paper
Vehicle routing with subtours	2019-11-28	Paper
Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two	2018-11-12	Paper
The repeater tree construction problem	2017-11-03	Paper
Two-level rectilinear Steiner trees	2017-07-05	Paper
Fast prefix adders for non-uniform input arrival times	2017-03-06	Paper
Combinatorial optimization in VLSI design	2014-11-10	Paper
Maximum-weight stable sets and safe lower bounds for graph coloring	2013-04-10	Paper
Shallow-Light Steiner Arborescences with Vertex Delays	2013-03-19	Paper
Safe lower bounds for graph coloring	2011-06-24	Paper

This page was built for person: Stephan Held