Faster approximation algorithms for the rectilinear Steiner tree problem

DOI10.1007/PL00009310zbMath0872.68140OpenAlexW2028766782MaRDI QIDQ1361816

Ulrich Fößmeier, Michael Kaufmann, Alexander Z. Zelikovsky

Publication date: 28 July 1997

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009310

zbMATH Keywords

Steiner tree problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (2)

The number of tree stars is \(O^{*}(1.357^k)\) ⋮ Bounding the expected number of rectilinear full Steiner trees

This page was built for publication: Faster approximation algorithms for the rectilinear Steiner tree problem