Publisher
Springer Nature Singapore
Reference30 articles.
1. Lecture Notes in Computer Science;MP de Aragão,2002
2. Arrighi, E., de Oliveira Oliveira, M.: Three is enough for Steiner trees. In: SEA 2021. LIPIcs, vol. 190, pp. 5:1–5:15 (2021)
3. Bastos, M.P., Ribeiro, C.C.: Reactive tabu search with path relinking for the Steiner problem in graphs. In: Essays and Surveys in Metaheuristics. Operations Research/Computer Science Interfaces Series. Springer, Boston (2002). https://doi.org/10.1007/978-1-4615-1507-4_2
4. Beyer, S., Chimani, M.: Strong Steiner tree approximations in practice. ACM J. Exp. Algor. 24(1), 1.7:1–1.7:33 (2019)
5. Byrka, J., Grandoni, F., Rothvoß, T., Sanità, L.: Steiner tree approximation via iterative randomized rounding. J. ACM 60(1), 6:1–6:33 (2013)