The following pages link to Stephan Held (Q513307):
Displaying 16 items.
- Fast prefix adders for non-uniform input arrival times (Q513308) (← links)
- (Q1675867) (redirect page) (← links)
- The repeater tree construction problem (Q1675870) (← links)
- Maximum-weight stable sets and safe lower bounds for graph coloring (Q1946922) (← links)
- Vehicle routing with subtours (Q2010917) (← links)
- An improved approximation algorithm for the uniform cost-distance Steiner tree problem (Q2117699) (← links)
- Two-level rectilinear Steiner trees (Q2362106) (← links)
- (Q2928707) (← links)
- Safe Lower Bounds for Graph Coloring (Q3009768) (← links)
- Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two (Q4554949) (← links)
- Shallow-Light Steiner Arborescences with Vertex Delays (Q4910819) (← links)
- Approximating the discrete time-cost tradeoff problem with bounded depth (Q5918419) (← links)
- Approximating the discrete time-cost tradeoff problem with bounded depth (Q5925637) (← links)
- Vehicle routing with time-dependent travel times: theory, practice, and benchmarks (Q6602334) (← links)
- Tighter approximation for the uniform cost-distance Steiner tree problem (Q6663032) (← links)
- Fractional Chromatic Numbers from Exact Decision Diagrams (Q6752054) (← links)
