Publisher
Springer International Publishing
Reference16 articles.
1. Bui, M., Butelle, F., Lavault, C.: A distributed algorithm for constructing a minimum diameter spanning tree. J. Parallel Distrib. Comput. 64(5), 571–577 (2004)
2. Chan, T.M.: Semi-online maintenance of geometric optima and measures. In: Proceedings of 13th ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 474–483 (2002)
3. Ding, W., Lin, G., Xue, G.: Diameter-constrained steiner trees. Discrete Math. Algorithms Appl. 3(4), 491–502 (2011)
4. Ding, W., Xue, G.: Minimum diameter cost-constrained Steiner trees. J. Comb. Optim. 27(1), 32–48 (2013). https://doi.org/10.1007/s10878-013-9611-2
5. Ding, W., Qiu, K.: Algorithms for the minimum diameter terminal Steiner tree problem. J. Comb. Optim. 28(4), 837–853 (2014)