Shallow-Light Steiner Arborescences with Vertex Delays

DOI10.1007/978-3-642-36694-9_20zbMath1372.68114OpenAlexW2232049732MaRDI QIDQ4910819

Daniel Rotter, Stephan Held

Publication date: 19 March 2013

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36694-9_20

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Steiner Trees with Bounded RC-Delay ⋮ Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology ⋮ Steiner trees with bounded RC-delay ⋮ Vehicle routing with subtours ⋮ Generalized Huffman coding for binary trees with choosable edge lengths ⋮ An improved approximation algorithm for the uniform cost-distance Steiner tree problem

This page was built for publication: Shallow-Light Steiner Arborescences with Vertex Delays