Author:
De Carufel Jean-Lou,Grimm Carsten,Schirra Stefan,Smid Michiel
Publisher
Springer International Publishing
Reference14 articles.
1. Cáceres, J., Garijo, D., González, A., Márquez, A., Puertas, M.L., Ribeiro, P.: Shortcut Sets for Plane Euclidean Networks. Electron. Notes Discrete Math. 54, 163–168 (2016)
2. Chepoi, V., Vaxès, Y.: Augmenting Trees to Meet Biconnectivity and Diameter Constraints. Algorithmica 33(2), 243–262 (2002)
3. De Carufel, J.L., Grimm, C., Maheshwari, A., Smid, M.: Minimizing the continuous diameter when augmenting paths and cycles with shortcuts. In: SWAT 2016, pp. 27:1–27:14 (2016)
4. Farshi, M., Giannopoulos, P., Gudmundsson, J.: Improving the Stretch Factor of a Geometric Network by Edge Augmentation. SIAM J. Comp. 38(1), 226–240 (2008)
5. Frati, F., Gaspers, S., Gudmundsson, J., Mathieson, L.: Augmenting Graphs to Minimize the Diameter. Algorithmica 72(4), 995–1010 (2015)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献