Query Complexity of the Metric Steiner Tree Problem

Yu Chen 0039, Sanjeev Khanna, Zihan Tan. Query Complexity of the Metric Steiner Tree Problem. In Nikhil Bansal 0001, Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023. pages 4893-4935, SIAM, 2023. [doi]

Abstract

Abstract is missing.