1 |
B. Yang, "Euclidean chains and their shortcuts," Theoretical Computer Science, vol. 497, pp. 55-67, July. 2013.
DOI
|
2 |
C. Johnson and H. Wang, "A linear-time algorithm for radius-optimally augmenting paths in a metric space," in Proceedings of the 16th Algorithms and Data Structures Symposium, pp. 466-480, 2019.
|
3 |
H. Wang and Y. Zhao, "A linear-time algorithm for discrete radius optimally augmenting paths in a metric space," International Journal of Computational Geometry & Applications, vol. 30, pp. 167-182, Sep. 2020.
DOI
|
4 |
J. L. De Carufel, C. Grimm, A. Maheshwari, and M. Smid, "Minimizing the continuous diameter when augmenting paths and cycles with shortcuts," Computational Geometry, vol. 89, pp. 409-427, Aug. 2020.
|
5 |
U. Grobe, C. Knauer, F. Stehn, J. Gudmundsson, and M. Smid, "Fast algorithms for diameter-optimally augmenting paths and trees," International Journal of Foundations of Computer Science, vol. 30, pp. 293-313, Jan. 2019.
DOI
|
6 |
N. Megiddo, "Applying parallel computation algorithms in the design of serial algorithms," Journal of the ACM, vol. 30, pp. 852-865, Jan. 1983.
DOI
|
7 |
D. Bilo, "Almost optimal algorithms for diameter-optimally augmenting trees," in Proceedings of the 29th International Symposium on Algorithms and Computation, pp. 40:1-40:13, 2018.
|
8 |
E. Oh and H. K. Ahn, "A near-optimal algorithm for finding an optimal shortcut of a tree," in Proceedings of the 27th International Symposium on Algorithms and Computation, pp. 59:1-59:12, 2016.
|
9 |
N. Alon, A. Gyarfas, and M. Ruszinko, "Decreasing the diameter of bounded degree graphs," Journal of Graph Theory, vol. 35, pp. 161-172, Sep. 2000.
DOI
|
10 |
D. Bilo, L. Guala, and G. Proietti, "Improved approximability and non-approximability results for graph diameter decreasing problem," Theoretical Computer Science, vol. 417, pp. 12-22, Feb. 2012.
DOI
|
11 |
F. Frati, S. Gaspers, J. Gudmundsson, and L. Mathieson, "Augmenting graphs to minimize the diameter," Algorithmica, vol. 72, pp. 995-1010, May. 2015.
DOI
|
12 |
D. Garijo, A. Marquez, N. Rodriguez, and R. I. Silveira, "Computing optimal shortcuts for networks," European Journal of Operational Research, vol. 279, pp. 26-37, Nov. 2019.
DOI
|
13 |
A. A. Schoone, H. L. Bodlaender, and J. V. Leeuwen, "Diameter increase caused by edge deletion," Journal of Graph Theory, vol. 11, pp. 409-427, Mar. 1987.
DOI
|
14 |
H. Wang and Y. Zhao, "Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees," in Proceedings of the 15th International Conference and Workshops on Algorithms and Computation, pp. 27-39, 2021.
|