Publisher
Springer Nature Switzerland
Reference20 articles.
1. Adriaens, F., Gionis, A.: Diameter minimization by shortcutting with degree constraints. CoRR abs/2209.00370 (2022). https://doi.org/10.48550/arXiv.2209.00370. Accepted at the IEEE ICDM 2022 conference
2. Bilò, D.: Almost optimal algorithms for diameter-optimally augmenting trees. Theor. Comput. Sci. 931, 31–48 (2022). https://doi.org/10.1016/j.tcs.2022.07.028
3. Bilò, D., Gualà, L., Proietti, G.: Improved approximability and non-approximability results for graph diameter decreasing problems. Theor. Comput. Sci. 417, 12–22 (2012)
4. Carufel, J.D., Grimm, C., Maheshwari, A., Schirra, S., Smid, M.H.M.: Minimizing the continuous diameter when augmenting a geometric tree with a shortcut. Comput. Geom. 89, 101631 (2020). https://doi.org/10.1016/j.comgeo.2020.101631
5. Carufel, J.D., Grimm, C., Maheshwari, A., Smid, M.H.M.: Minimizing the continuous diameter when augmenting paths and cycles with shortcuts. In: Pagh, R. (ed.) 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016. LIPIcs, vol. 53, pp. 27:1–27:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)