The following publications are possibly variants of this publication:
- Tractabilities for Tree Assembly ProblemsFeng Shi 0003, Jie You, Zhen Zhang, Jingyi Liu. tamc 2020: 300-312 [doi]
- Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problemMattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci 0001, Guido Proietti. jco, 38(1):165-184, 2019. [doi]
- Euclidean Bottleneck Steiner Tree is Fixed-Parameter TractableSayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh 0001, Jie Xue 0003. soda 2024: 699-711 [doi]