Approximation algorithms for spanner problems and Directed Steiner Forest

Approximate distance oracles

Mikkel Thorup, Uri Zwick · Journal of the ACM · 2005 · 618 citations

Computing, Computer Science, Mathematics +14

On sparse spanners of weighted graphs

Ingo Althöfer, Gautam Das, David Dobkin et al. · Discrete & Computational Geometry · 1993 · 600 citations · Full text

Computing, Computer Science, Mathematics +12

Compact routing schemes

Mikkel Thorup, Uri Zwick · 2001 · 521 citations

Computing, Computer Science, Algorithms +10

Graph spanners

David Peleg, Alejandro A. Schäffer · Journal of Graph Theory · 1989 · 419 citations

Computing, Computer Science, Mathematics +12

A trade-off between space and efficiency for routing tables

David Peleg, Eli Upfal · Journal of the ACM · 1989 · 350 citations · Full text

Computing, Computer Engineering, Computer Science +12