Approximating spanners and directed steiner forest: upper and lower bounds
SODA '17: Symposium on Discrete Algorithms Barcelona Spain January, 2017, pp. 534-553, 2017.
It was recently found that there are very close connections between the existence of additive spanners (subgraphs where all distances are preserved up to an additive stretch), distance preservers (subgraphs in which demand pairs have their distance preserved exactly), and pairwise spanners (subgraphs in which demand pairs have their dista...More
PPT (Upload PPT)