1. Ahmed, R., et al.: Multi-level Steiner trees. Proceedings of the 17th International Symposium on Experimental Algorithms (2018)
2. Ahmed, R., Sahneh, F.D., Kobourov, S., Spence, R.: Kruskal-based approximation algorithm for the multi-level Steiner tree problem. Proceedings of the 28th Annual European Symposium on Algorithms (2020)
3. Lecture Notes in Computer Science;S Angelopoulos,2009
4. Balakrishnan, A., Magnanti, T.L., Mirchandani, P.: Modeling and heuristic worst-case performance analysis of the two-level network design problem. Manag. Sci. 40(7), 846–867 (1994)
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)