Exact algorithms for the bottleneck Steiner tree problem (extended abstract)

DOI10.1007/978-3-642-10631-6_5MaRDI QIDQ3652188zbMATH OpenOpenAlexFDO

Authors Sang Won Bae, Chunseok Lee, Shin-Ichi Tanigawa, 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 algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Exact algorithms for the bottleneck Steiner tree problem
• On exact solutions to the Euclidean bottleneck Steiner tree problem
• On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem
• Optimal and approximate bottleneck Steiner trees
• On the full and bottleneck full Steiner tree problems

Cited in

(10)

• An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
• On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem
• The bottleneck 2-connected k-Steiner network problem for k 2
• The bottleneck selected‐internal and partial terminal Steiner tree problems
• scientific article; zbMATH DE number 1424548 (Why is no real title available?)
• Fixed parameter tractability of a biconnected bottleneck Steiner network problem
• An exact branch and bound algorithm for the Steiner Problem in Graphs
• Exact algorithms for the bottleneck Steiner tree problem
• On exact solutions to the Euclidean bottleneck Steiner tree problem
• An exact algorithm for the bottleneck 2-connected k-Steiner network problem in L_p planes

This page was built for publication: Exact algorithms for the bottleneck Steiner tree problem (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3652188)