Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh 0001, Jie Xue 0003. Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. In David P. Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024. pages 699-711, SIAM, 2024. [doi]
Abstract is missing.