We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices. We explore several variations of the problem and give O(1)-approximations for each. We also improve the best known approximation ratio for metric k-median with penalties, as many of our approximations depend upon this bound. We give a (1 + 2 (p+1)/β(p+1)-1, β)-approximation with runtime exponential in p. If we set β=1 (to be exact on the number of medians), this matches the best current k-median (without penalties) result. © 2009 Springer.
CITATION STYLE
Meyerson, A., & Tagiku, B. (2009). Minimizing average shortest path distances via shortcut edge addition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5687 LNCS, pp. 272–285). https://doi.org/10.1007/978-3-642-03685-9_21
Mendeley helps you to discover research relevant for your work.