Adam Meyerson, Brian Tagiku. Minimizing Average Shortest Path Distances via Shortcut Edge Addition. In Irit Dinur, Klaus Jansen, Joseph Naor, José D. P. Rolim, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings. Volume 5687 of Lecture Notes in Computer Science, pages 272-285, Springer, 2009. [doi]
@inproceedings{MeyersonT09,
title = {Minimizing Average Shortest Path Distances via Shortcut Edge Addition},
author = {Adam Meyerson and Brian Tagiku},
year = {2009},
doi = {10.1007/978-3-642-03685-9_21},
url = {http://dx.doi.org/10.1007/978-3-642-03685-9_21},
researchr = {https://researchr.org/publication/MeyersonT09},
cites = {0},
citedby = {0},
pages = {272-285},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings},
editor = {Irit Dinur and Klaus Jansen and Joseph Naor and José D. P. Rolim},
volume = {5687},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-03684-2},
}