Exact Algorithms for the Bottleneck Steiner Tree Problem

DOI10.1007/978-3-642-10631-6_5zbMath1272.68329OpenAlexW2125048090MaRDI QIDQ3652188

Shin-ichi Tanigawa, Chunseok Lee, Sang Won Bae, Sung Hee Choi

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_5

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Fixed parameter tractability of a biconnected bottleneck Steiner network problem ⋮ The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\) ⋮ On exact solutions to the Euclidean bottleneck Steiner tree problem

This page was built for publication: Exact Algorithms for the Bottleneck Steiner Tree Problem