Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference23 articles.
1. Abraham, I., Bartal, Y., Neiman, O.: Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 502–511 (2007)
2. Alstrup, S., Holm, J., de Lichtenberg, K., Thorup, M.: Maintaining information in fully dynamic trees with top trees. ACM Trans. Algorithms 1(2), 243–264 (2005). https://doi.org/10.1145/1103963.1103966
3. Bilò, D., Colella, F., Gualà, L., Leucci, S., Proietti, G.: A faster computation of all the best swap edges of a tree spanner. In: Proceedings of the International Colloquium on Structural Information and Communication Complexity, pp. 239–253 (2015). https://doi.org/10.1007/978-3-319-25258-2_17
4. Bilò, D., Colella, F., Gualà, L., Leucci, S., Proietti, G.: Effective edge-fault-tolerant single-source spanners via best (or good) swap edges. In: Proceedings of the 24th International Colloquium on Structural Information and Communication Complexity, pp. 303–317 (2017). https://doi.org/10.1007/978-3-319-72050-0_18
5. Bilò, D., Gualà, L., Proietti, G.: Finding best swap edges minimizing the routing cost of a spanning tree. Algorithmica 68(2), 337–357 (2014). https://doi.org/10.1007/s00453-012-9674-y
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献